论文信息 - Expected Behavior of Graph Coloring Algorithms - 字舞流文

Expected Behavior of Graph Coloring Algorithms

Ludek Kucera | L. Kucera

[1] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[2] David S. Johnson,et al. The Complexity of Near-Optimal Graph Coloring , 1976, J. ACM.

[3] Colin McDiarmid,et al. Topics in Chromatic Graph Theory: Colouring random graphs , 2015 .

[4] Larry Stockmeyer,et al. Planar 3-colorability is polynomial complete , 1973, SIGA.

[5] Raymond E. Miller,et al. Complexity of Computer Computations , 1972 .

[6] Ronald C. Read,et al. Graph theory and computing , 1972 .

[7] D. Matula,et al. GRAPH COLORING ALGORITHMS , 1972 .

[8] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[9] D. J. A. Welsh,et al. An upper bound for the chromatic number of a graph and its application to timetabling problems , 1967, Comput. J..