论文信息 - An exact algorithm for graph coloring with polynomial memory - 字舞流文

An exact algorithm for graph coloring with polynomial memory

In this paper, we give an algorithm that computes the chromatic number of a graph in O(5.283n) time and polynomial memory.

H. Bodlaender | D. Kratsch

[1] Eugene L. Lawler,et al. A Note on the Complexity of the Chromatic Number Problem , 1976, Inf. Process. Lett..

[2] Gerhard J. Woeginger,et al. Exact Algorithms for NP-Hard Problems: A Survey , 2001, Combinatorial Optimization.

[3] Gerhard J. Woeginger,et al. Space and Time Complexity of Exact Algorithms: Some Open Problems (Invited Talk) , 2004, IWPEC.

[4] Jesper Makholm Byskov. Enumerating maximal independent sets with applications to graph colouring , 2004, Oper. Res. Lett..

[5] Uwe Schöning,et al. Algorithmics in Exponential Time , 2005, STACS.

[6] David Eppstein,et al. 3-Coloring in Time O(1.3289^n) , 2000, J. Algorithms.