Successfully reported this slideshow.
We use your LinkedIn profile and activity data to personalize ads and to show you more relevant ads. You can change your ad preferences anytime.

Algorithms for Graph Coloring Problem

Course Project Presentation

  • Be the first to comment

Algorithms for Graph Coloring Problem

  1. 1. Algorithms for Graph Coloring Problem Wang Shengyi National University of Singapore November 6, 2014 Wang Shengyi (NUS) Algorithms for Graph Coloring Problem November 6, 2014 1 / 24
  2. 2. Introduction Problem Description Problem Description • For a graph G = (V; E) and a color sequence c = (c0; c1; : : : ; cn), firstly choose a node v 2 V and populate with c0 • Populate the rest of G in order of the rest of color sequence c such that only new nodes connected to a previously populated node may be populated. • Each populated G can be called a configuration, which can be seen as a function f mapping node to color. We can calculate a reward value for such a configuration f by the following formula: H = Σ All filled (i;j)2E 1

×