An exact algorithm for graph coloring with polynomial memory

DSpace/Manakin Repository

An exact algorithm for graph coloring with polynomial memory
 
Bodlaender, H.L.; Kratsch, D.
(2006) UU-CS, volume 2006-015
(Report)
Abstract
In this paper, we give an algorithm that computes the chromatic number of a graph in O(5.283n) time and polynomial memory.
Download/Full Text
Open Access version via Utrecht University Repository
 
ISSN: 0924-3275
Publisher: Utrecht University
 
 
See more statistics about this item