Re: Learning about Graph Coloring

mueller@delta.cs.fsu.edu (Frank Mueller)
Wed, 24 Mar 1993 19:11:12 GMT

          From comp.compilers
Related articles
Learning about Graph Coloring benjamin.vitale@acadiau.ca (1993-03-23)
Re: Learning about Graph Coloring preston@dawn.cs.rice.edu (1993-03-24)
Re: Learning about Graph Coloring mueller@delta.cs.fsu.edu (1993-03-24)
Re: Learning about Graph Coloring johnl@iecc.cambridge.ma.us (John R. Levine) (1993-03-26)
| List of all articles for this month |
Newsgroups: comp.compilers
From: mueller@delta.cs.fsu.edu (Frank Mueller)
Keywords: optimize, registers
Organization: Florida State University Computer Science
References: 93-03-084
Date: Wed, 24 Mar 1993 19:11:12 GMT

benjamin.vitale@acadiau.ca (Benjamin Vitale) writes:
> Can anyone suggest some simple introductory information on algorithms
> for the graph coloring problem. A colleague is writing a survey paper
> on RISC compiler optimization and is having trouble finding resources.


I wrote a somewhat comprehensive summary of graph coloring approaching from
a graph-theoretic point of view. If you are interested, please e-mail me
and I'll make the postscript available.


Frank
mueller@cs.fsu.edu
--

Post a followup to this message

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