Graph Coloring

"Robert Sherry" <rsherry8@comcast.net>
1 Feb 2004 12:47:55 -0500

          From comp.compilers
Related articles
Graph Coloring rsherry8@comcast.net (Robert Sherry) (2004-02-01)
Re: Graph Coloring jle@forest.owlnet.rice.edu (2004-02-04)
Re: graph coloring Robert.Thorpe@antenova.com (Robert Thorpe) (2004-02-08)
Re: graph coloring jmcenerney@austin.rr.com (John McEnerney) (2004-02-12)
Re: Graph Coloring touati@prism.uvsq.fr (TOUATI Sid) (2004-02-12)
graph coloring bsr@cs.clemson.edu (Ramesh B S) (1996-03-20)
Re: graph coloring dgillies@hpax.cup.hp.com (David Gillies) (1996-03-22)
[2 later articles]
| List of all articles for this month |
From: "Robert Sherry" <rsherry8@comcast.net>
Newsgroups: comp.compilers
Date: 1 Feb 2004 12:47:55 -0500
Organization: Compilers Central
Keywords: registers, optimize, question
Posted-Date: 01 Feb 2004 12:47:55 EST

                        I am in the process of developing a new graph coloring
algorithm that I think is applicable to graphs generated in register
allocation. It is my understanding that graphs that needed to me
coloring in a compiler have a significant number of vertices that are
of high degree and at the same time a significant number of vertices
of low degree.


                        Is this true and can somebody tell me if this is discussed
in any journal articles?


                                                                                                Robert Sherry




Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.