A range-compaction heuristic for graph coloring

DOI10.1023/B:HEUR.0000012448.70007.32MaRDI QIDQ1430046zbMATH OpenFDO

Authors Andrea Di Blas, Richard Hughey, Arun Jagota

Publication date 27 May 2004

Published in Journal of Heuristics (Search for Journal in Brave)

zbMATH Keywords

graph coloringDIMACS benchmarksiterative-greedy algorithm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 1703855
• Local optimization of colorings of graphs
• scientific article; zbMATH DE number 1488073
• Simple decentralized graph coloring
• A Large Neighborhood Search Heuristic for Graph Coloring

Cited in

(6)

• Spectrum graph coloring and applications to Wi-Fi channel assignment
• Exploring the role of graph spectra in graph coloring algorithm performance
• Experimental analysis of algorithms for the dynamic graph coloring problem
• A fresh look at a randomized massively parallel graph coloring algorithm
• scientific article; zbMATH DE number 1703855 (Why is no real title available?)
• Simple decentralized graph coloring

This page was built for publication: A range-compaction heuristic for graph coloring

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