I need an algorythm to get the cromatic number of a graph.
Posted
by Carlos Sanchez
on Stack Overflow
See other posts from Stack Overflow
or by Carlos Sanchez
Published on 2010-05-28T02:37:28Z
Indexed on
2010/05/28
2:41 UTC
Read the original article
Hit count: 229
Given the adjacency matrix of a graph, i need to obtain the cromatic number (minimum number of colours within you can paint every node of a graph). preferably it should be a java algoryhtm, and i don't care about performance. thanks.
© Stack Overflow or respective owner