| 
|
QuoteRef: pereFM11_2005
Topic:
register allocation by graph coloring
Topic:
graphs
Reference
Pereira,F. M. Q., Palsberg, J., "Register allocation via coloring of chordal graphs", pp. 316-329, in Kwangkeun, Y. (ed.), Programming Languages and Systems. Third Asian Symposium, APLAS 2005, Tsukuba Japan, November 2005, LNCS 3780. Google
abstract ;;Quote: register allocation via greedy coloring of chordal graphs; better than iterated register coalescing over a few registers
316 ;;Quote: an undirected graph without self-loops is chordal iff it has a simplicial elimination ordering
Topic: register allocation by graph coloring (21 items)
Topic: graphs (18 items)