Approximate triclique coloring for register allocation

DOI10.1016/S0020-0190(96)00174-3zbMath0900.68334MaRDI QIDQ673230

C. Pandu Rangan, G. Venkatesan

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)

Related Items (3)

Approximate triclique coloring for register allocation ⋮ Circular-arc graph coloring: On chords and circuits in the meeting graph ⋮ On the complexity of finding internally vertex-disjoint long directed paths

Cites Work

• Unnamed Item
• Unnamed Item
• Approximate triclique coloring for register allocation
• Packing subgraphs in a graph
• Paths, Trees, and Flowers

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