An exact algorithm for graph coloring with polynomial memory
Files
Publication date
2006
Authors
Bodlaender, H.L.
Kratsch, D.
Editors
Advisors
Supervisors
DOI
Document Type
Report
Metadata
Show full item recordCollections
License
Abstract
In this paper, we give an algorithm that computes the chromatic number of a
graph in O(5.283n) time and polynomial memory.