Revisiting Graph Coloring Register Allocation: A Study of the Chaitin-Briggs and Callahan-Koblenz Algorithms

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-69330-7_1
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

New Approximation Algorithms for Graph Coloring

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1994English

Efficient Register Allocation via Coloring Using Clique Separators

ACM Transactions on Programming Languages and Systems
Software
1994English

An Efficient Graph-Coloring Algorithm for Processor Allocation

International Journal of Information Technology and Computer Science
2013English

Experiments With Parallel Graph Coloring Heuristics and Applications of Graph Coloring

DIMACS Series in Discrete Mathematics and Theoretical Computer Science
1996English

Polynomial Approximation and Graph-Coloring

Computing (Vienna/New York)
Numerical AnalysisComputational TheoryComputer Science ApplicationsComputational MathematicsMathematicsTheoretical Computer ScienceSoftware
2003English

Mixed Graph Edge Coloring

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2009English

Graph Coloring With webMathematica

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Effective and Efficient Dynamic Graph Coloring

Proceedings of the VLDB Endowment
Computer Science
2017English

SARA: Combining Stack Allocation and Register Allocation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy