论文信息 - Fast solution of some random NP-hard problems - 字舞流文

Fast solution of some random NP-hard problems

Martin E. Dyer | Alan M. Frieze | A. Frieze | M. Dyer

[1] Jonathan S. Turner,et al. Almost All k-Colorable Graphs are Easy to Color , 1988, J. Algorithms.

[2] A. Thomason. Pseudo-Random Graphs , 1987 .

[3] Martin E. Dyer,et al. On the complexity of partitioning graphs into connected subgraphs , 1985, Discret. Appl. Math..

[4] Jonathan S. Turner. On the Probable Performance of Graph coloring Algorithms , 1985 .

[5] Frank Thomson Leighton,et al. Graph bisection algorithms with good average case behavior , 1984, Comb..

[6] Ludek Kucera,et al. Expected Behavior of Graph Coloring Algorithms , 1977, FCT.