Graph coloring Algorithm

Posted by Amitd on Stack Overflow See other posts from Stack Overflow or by Amitd
Published on 2010-03-15T06:06:55Z Indexed on 2010/03/15 6:09 UTC
Read the original article Hit count: 408

Filed under:
|
|
|

From wiki

In its simplest form, it is a way of coloring the vertices of a graph such that no two adjacent vertices share the same color; this is called a vertex coloring. Similarly, an edge coloring assigns a color to each edge so that no two adjacent edges share the same color, and a face coloring of a planar graph assigns a color to each face or region so that no two faces that share a boundary have the same color.

Given 'n' colors and m vertices, how easily can a graph coloring algorithm be implemented?

Lan

© Stack Overflow or respective owner

Related posts about graph

Related posts about color