Approximate triclique coloring for register allocation

DOI10.1016/S0020-0190(96)00174-3MaRDI QIDQ673230zbMATH OpenFDO

Authors G. Venkatesan, C. Pandu Rangan

Publication date 28 February 1997

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

AlgorithmsApproximate algorithmsChromatic numberControl-flow graphRegister allocation graph (RAG)Triclique

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• An approximation algorithm for the register allocation problem
• Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs
• Using graph coloring in an algebraic compiler
• scientific article; zbMATH DE number 1956454
• Register Allocation in Structured Programs

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 910892 (Why is no real title available?)
• Approximate triclique coloring for register allocation
• Packing subgraphs in a graph
• Paths, Trees, and Flowers

Cited in

(4)

• Circular-arc graph coloring: On chords and circuits in the meeting graph
• scientific article; zbMATH DE number 1956454 (Why is no real title available?)
• Approximate triclique coloring for register allocation
• Using graph coloring in an algebraic compiler

This page was built for publication: Approximate triclique coloring for register allocation

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