A range-compaction heuristic for graph coloring
From MaRDI portal
Recommendations
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)