22 Sep 2005 23:37:57 -0400

Related articles |
---|

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 touati@prism.uvsq.fr (TOUATI Sid) (2005-09-27) |

Re: Coloring a graph with exact N colors nkavv@skiathos.physics.auth.gr (Uncle Noah) (2005-09-30) |

Re: Coloring a graph with exact N colors touati@prism.uvsq.fr (TOUATI Sid) (2005-09-30) |

From: | "tzuchien <dot> chiu <at> gmail <dot> com" <tzuchien.chiu@gmail.com> |

Newsgroups: | comp.compilers |

Date: | 22 Sep 2005 23:37:57 -0400 |

Organization: | http://groups.google.com |

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.

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.