|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 email@example.com (TOUATI Sid) (2005-09-27)|
|Re: Coloring a graph with exact N colors firstname.lastname@example.org (Uncle Noah) (2005-09-30)|
|Re: Coloring a graph with exact N colors email@example.com (TOUATI Sid) (2005-09-30)|
|From:||"tzuchien <dot> chiu <at> gmail <dot> com" <firstname.lastname@example.org>|
|Date:||22 Sep 2005 23:37:57 -0400|
|Keywords:||registers, theory, question|
It's actually a register allocation problem.
I'm looking for an algorithm to color a graph with exact N colors,
usually N is larger than the chromatic number of the graph. However,
the number of occurrences of each color is expected to be the same, in
probability. That is, each color is used as roughly many times to
color the graph.
In the other words, the vertices are partitioned into N independent
sets, and the number of vertices in each indepedent set shoudl be
roughly the same.
Return to the
Search the comp.compilers archives again.