Using graph coloring in an algebraic compiler

DOI10.1007/S002360050079MaRDI QIDQ1920231zbMATH OpenOpenAlexWikidataFDO

Authors Teodor Rus, Sriram Pemmaraju

Publication date 25 September 1996

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002360050079

zbMATH Keywords

algebraic compilerclique-composable graphsgraph coloringoptimally colored subgraphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Theory of compilers and interpreters (68N20) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Programming Languages and Systems
• On a graph-theoretical model for cyclic register allocation
• scientific article; zbMATH DE number 910892
• scientific article; zbMATH DE number 1956454
• Approximate triclique coloring for register allocation

Cited in

(4)

• Algebraic processing of programming languages
• Coloring terms to control equational reasoning
• Programming Languages and Systems
• Approximate triclique coloring for register allocation

This page was built for publication: Using graph coloring in an algebraic compiler

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1920231)