A Range-Compaction Heuristic for Graph Coloring

Authors:
Andrea Di Blas;Arun Jagota;Richard Hughey
Affiliations:
Department of Computer Engineering, University of California, Santa Cruz, 1156 High St. Santa Cruz, CA 95064, USA. andrea@soe.ucsc.edu;Department of Computer Engineering, University of California, Santa Cruz, 1156 High St. Santa Cruz, CA 95064, USA;Department of Computer Engineering, University of California, Santa Cruz, 1156 High St. Santa Cruz, CA 95064, USA
Venue:
Journal of Heuristics
Year:
2003

Citing 13
Cited 0

Using tabu search techniques for graph coloring

Computing
A randomised 3-colouring algorithm

Discrete Mathematics - Graph colouring and variations
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
High-level synthesis: introduction to chip and system design

High-level synthesis: introduction to chip and system design
Scheduling algorithms for multihop radio networks

IEEE/ACM Transactions on Networking (TON)
Exact coloring of real-life graphs is easy

DAC '97 Proceedings of the 34th annual Design Automation Conference
Efficient coloring of a large spectrum of graphs

DAC '98 Proceedings of the 35th annual Design Automation Conference
New methods to color the vertices of a graph

Communications of the ACM
Synthesis and Optimization of Digital Circuits

Synthesis and Optimization of Digital Circuits
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
"Squeaky Wheel" optimization

Journal of Artificial Intelligence Research
Static and dynamic channel assignment using neural networks

IEEE Journal on Selected Areas in Communications
Energy function-based approaches to graph coloring

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a novel heuristic for graph coloring that works on a range of colors and iteratively tries to make this range more compact. This range-compaction heuristic also has a “pressure” component and an annealing schedule for it. The value of this component is empirically quantified. This algorithm is evaluated on a wide range of DIMACS benchmark graphs, and found to be competitive with state-of-the-art algorithms in terms of solution quality and run time.