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 条
  • [21] Colouring random graphs in expected polynomial time
    Coja-Oghlan, A
    Taraz, A
    STACS 2003, PROCEEDINGS, 2003, 2607 : 487 - 498
  • [22] The cover time of sparse random graphs.
    Cooper, C
    Frieze, A
    PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 140 - 147
  • [23] Randomly coloring sparse random graphs with fewer colors than the maximum degree
    Dyer, Martin
    Flaxman, Abraham D.
    Frieze, Alan M.
    Vigoda, Eric
    RANDOM STRUCTURES & ALGORITHMS, 2006, 29 (04) : 450 - 465
  • [24] EQUITABLE COLORING OF SPARSE PLANAR GRAPHS
    Luo, Rong
    Sereni, Jean-Sebastien
    Stephens, D. Christopher
    Yu, Gexin
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2010, 24 (04) : 1572 - 1583
  • [25] List Dynamic Coloring of Sparse Graphs
    Kim, Seog-Jin
    Park, Won-Jin
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, 2011, 6831 : 156 - 162
  • [26] Randomly Coloring Random Graphs
    Dyer, Martin
    Frieze, Alan
    RANDOM STRUCTURES & ALGORITHMS, 2010, 36 (03) : 251 - 272
  • [27] Injective edge coloring of sparse graphs
    Lai, Hong-Jian
    Luo, Austin
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2024,
  • [28] (k, j)-coloring of sparse graphs
    Borodin, O. V.
    Ivanova, A. O.
    Montassier, M.
    Raspaud, A.
    DISCRETE APPLIED MATHEMATICS, 2011, 159 (17) : 1947 - 1953
  • [29] Acyclic edge coloring of sparse graphs
    Wang, Yingqian
    Sheng, Ping
    DISCRETE MATHEMATICS, 2012, 312 (24) : 3561 - 3573
  • [30] (k, 1)-coloring of sparse graphs
    Borodin, O. V.
    Ivanova, A. O.
    Montassier, M.
    Raspaud, A.
    DISCRETE MATHEMATICS, 2012, 312 (06) : 1128 - 1135
12345