3-Coloring in time O(1.3446n): a no-MIS algorithm
作者： David Eppstein , Richard Beigel
DOI:
关键词: Discrete mathematics 、 Mathematics 、 Rabin–Karp algorithm 、 Freivalds' algorithm 、 Complete coloring 、 Combinatorics 、 List coloring
摘要:
参考文章(3)
Bjarne Toft, Tommy R Jensen, Graph Coloring Problems ,(1994)
Miklo Shindo, Etsuji Tomita, A Simple Algorithm for Finding a Maximum Clique and Its Worst-Case Time Complexity Systems and Computers in Japan. ,vol. 21, pp. 1- 13 ,(1990) , 10.1002/SCJ.4690210301
J. W. Moon, L. Moser, On cliques in graphs Israel Journal of Mathematics. ,vol. 3, pp. 23- 28 ,(1965) , 10.1007/BF02760024