Approximate triclique coloring for register allocation

DOI10.1016/S0020-0190(96)00174-3zbMATH Open0900.68334MaRDI QIDQ673230FDOQ673230

Authors: G. Venkatesan, C. Pandu Rangan 

Publication date: 28 February 1997

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

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

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)

Cites Work

• Title not available (Why is that?)
• Paths, Trees, and Flowers
• Packing subgraphs in a graph
• Title not available (Why is that?)
• Approximate triclique coloring for register allocation

Cited In (4)

• Title not available (Why is that?)
• Circular-arc graph coloring: On chords and circuits in the meeting graph
• Using graph coloring in an algebraic compiler
• Approximate triclique coloring for register allocation

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)