Coloring sparse random graphs in polynomial average time

被引：0
|
作者：
Subramanian, C.R. [1 ]
机构：
[1] Max-Planck Institute für Informatik, Stuhlsatzenhausweg 85, Saarbrücken,66123, Germany
来源：
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2000年 / 1879卷
关键词：
D O I：
10.1007/3-540-45253-2_38
中图分类号：
学科分类号：
摘要：
Coloring
引用
收藏
页码：415 / 426
相关论文
共 50 条
  • [1] Coloring sparse random k-colorable graphs in polynomial expected time
    Böttcher, J
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2005, PROCEEDINGS, 2005, 3618 : 156 - 167
  • [2] Coloring semi-random graphs in polynomial expected time
    Subramanian, CR
    Madhavan, CEV
    FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, 1994, 880 : 137 - 148
  • [3] Average-case complexity of backtrack search for coloring sparse random graphs
    Mann, Zoltan Adam
    Szajko, Aniko
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2013, 79 (08) : 1287 - 1301
  • [4] Minimum coloring k-colorable graphs in polynomial average time
    Subramanian, CR
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1999, 33 (01): : 112 - 123
  • [5] Minimum Coloring k-Colorable Graphs in Polynomial Average Time
    Subramanian, C.R.
    Journal of Algorithms, 1999, 33 (01): : 112 - 123
  • [6] A note on coloring sparse random graphs
    Sommer, Christian
    DISCRETE MATHEMATICS, 2009, 309 (10) : 3381 - 3384
  • [7] On-line coloring of sparse random graphs and random trees
    Pittel, B
    Weishaar, RS
    JOURNAL OF ALGORITHMS, 1997, 23 (01) : 195 - 205
  • [8] Polynomial iterative algorithms for coloring and analyzing random graphs
    Braunstein, A
    Mulet, R
    Pagnani, A
    Weigt, M
    Zecchina, R
    PHYSICAL REVIEW E, 2003, 68 (03)
  • [9] An Experimental Analysis of Vertex Coloring Algorithms on Sparse Random Graphs
    Healy, Patrick
    Ju, Andrew
    APPLIED ALGORITHMS, 2014, 8321 : 174 - 186
  • [10] The cover time of sparse random graphs
    Cooper, Colin
    Frieze, Alan
    RANDOM STRUCTURES & ALGORITHMS, 2007, 30 (1-2) : 1 - 16
12345