A range-compaction heuristic for graph coloring

DOI10.1023/B:HEUR.0000012448.70007.32zbMath1081.68068MaRDI QIDQ1430046

Richard Hughey, Andrea Di Blas, Arun K. Jagota

Publication date: 27 May 2004

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

zbMATH Keywords

graph coloring; DIMACS benchmarks; iterative-greedy algorithm

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C15: Coloring of graphs and hypergraphs

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Related Items

Spectrum graph coloring and applications to Wi-Fi channel assignment