|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:||"Uncle Noah" <firstname.lastname@example.org>|
|Date:||30 Sep 2005 02:02:04 -0400|
|Posted-Date:||30 Sep 2005 02:02:03 EDT|
TOUATI Sid wrote:
> 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.
Are you referring to a register allocation via graph coloring for
heterogeneous register set (i.e. different register files e.g. for
different data types or for some purpose that needs register
I mean: does q-coloring target such problem?
aka "Uncle Noah"
Return to the
Search the comp.compilers archives again.