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 条
  • [31] Random coloring evolution on graphs
    Chen, Xin Xing
    Ying, Jian Gang
    ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2010, 26 (02) : 369 - 376
  • [32] Equitable Coloring of Random Graphs
    Krivelevich, Michael
    Patkos, Balazs
    RANDOM STRUCTURES & ALGORITHMS, 2009, 35 (01) : 83 - 99
  • [33] Random Coloring Evolution on Graphs
    Xin Xing CHEN Department of Mathematics
    ActaMathematicaSinica(EnglishSeries), 2010, 26 (02) : 369 - 376
  • [34] A Complexity Dichotomy for the Coloring of Sparse Graphs
    Esperet, Louis
    Montassier, Mickael
    Ochem, Pascal
    Pinlou, Alexandre
    JOURNAL OF GRAPH THEORY, 2013, 73 (01) : 85 - 102
  • [35] Injective edge coloring of sparse graphs
    Bu, Yuehua
    Qi, Chentao
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2018, 10 (02)
  • [36] Random coloring evolution on graphs
    Xin Xing Chen
    Jian Gang Ying
    Acta Mathematica Sinica, English Series, 2010, 26 : 369 - 376
  • [37] On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments
    Gishholiner, Lior
    Krivelevich, Michael
    Kronenberg, Gal
    RANDOM STRUCTURES & ALGORITHMS, 2018, 52 (04) : 545 - 559
  • [38] Coloring κ-colorable semirandom graphs in polynomial expected time via semidefinite programming
    Coja-Oghlan, A
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2002, 2002, 2420 : 201 - 211
  • [39] A polynomial-time algorithm for conformable coloring on regular bipartite and subcubic graphs
    Faria, Luerbio
    Nigro, Mauro
    Sasaki, Diana
    DISCRETE OPTIMIZATION, 2025, 55
  • [40] Edge coloring of graphs with small average degrees
    Luo, R
    Zhang, CQ
    DISCRETE MATHEMATICS, 2004, 275 (1-3) : 207 - 218
12345