|Coloring a graph with exact N colors dot (tzuchienchiu <at> gmail <dot> com<tzuchien.chiu@gm) (2005-09-22)|
|Re: Coloring a graph with exact N colors firstname.lastname@example.org (TOUATI Sid) (2005-09-27)|
|Re: Coloring a graph with exact N colors email@example.com (Uncle Noah) (2005-09-30)|
|Re: Coloring a graph with exact N colors firstname.lastname@example.org (TOUATI Sid) (2005-09-30)|
|From:||TOUATI Sid <email@example.com>|
|Date:||27 Sep 2005 09:50:19 -0400|
|Organization:||Universite de Versailles Saint-Quentin-en-Yvelines|
|Posted-Date:||27 Sep 2005 09:50:19 EDT|
This is called q-coloring in graph theory (q=N in your message). The
complexity is not exponential as with optimal coloring, but the constant
of the complexity is high (=N!). In practice, N <= 12 is an observed limit.
Return to the
Search the comp.compilers archives again.