Improved edge-coloring with three colors

被引：0
|
作者：
Kowalik, Lukasz [1 ]
机构：
[1] Warsaw Univ, Inst Informat, Warsaw, Poland
[2] Max Planck Inst Informat, Saarbrucken, Germany
来源：
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE | 2006年 / 4271卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We show an O(1.344(n)) = O(2(0.427n)) algorithm for edge-coloring an n-vertex graph using three colors. Our algorithm uses polynomial space. This improves over the previous, O(2(n/2)) algorithm of Beigel and Eppstein [1]. We extend a very natural approach of generating inclusion-maximal matchings of the graph. The time complexity of our algorithm is estimated using the "measure and conquer" technique.
引用
收藏
页码：90 / 101
页数：12
相关论文
共 50 条
  • [1] Improved edge-coloring with three colors
    Kowalik, Lukasz
    [J]. THEORETICAL COMPUTER SCIENCE, 2009, 410 (38-40) : 3733 - 3742
  • [2] Edge-coloring cliques with many colors on subcliques
    Eichhorn, D
    Mubayi, D
    [J]. COMBINATORICA, 2000, 20 (03) : 441 - 444
  • [3] Edge-coloring cliques with three colors on all 4-cliques
    Mubayi, D
    [J]. COMBINATORICA, 1998, 18 (02) : 293 - 296
  • [4] INTERVAL EDGE-COLORING OF A GRAPH WITH FORBIDDEN COLORS
    KUBALE, M
    [J]. DISCRETE MATHEMATICS, 1993, 121 (1-3) : 135 - 143
  • [5] Deterministic Distributed Edge-Coloring with Fewer Colors
    Ghaffari, Mohsen
    Kuhn, Fabian
    Maus, Yannic
    Uitto, Jara
    [J]. STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2018, : 418 - 430
  • [6] Note – Edge-Coloring Cliques with Three Colors on All 4-Cliques
    Dhruv Mubayi
    [J]. Combinatorica, 1998, 18 : 293 - 296
  • [7] EDGE-COLORING OF PLANE GRAPHS WITH MANY COLORS ON FACES
    Czap, J.
    Jendrol, S.
    Valiska, J.
    [J]. ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, 2019, 88 (03): : 573 - 576
  • [8] From edge-coloring to strong edge-coloring
    Borozan, Valentin
    Chang, Gerard Jennhwa
    Cohen, Nathann
    Fujita, Shinya
    Narayanan, Narayanan
    Naserasr, Reza
    Valicov, Petru
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2015, 22 (02):
  • [9] NOTE – Edge-Coloring Cliques with Many Colors on Subcliques
    Dennis Eichhorn
    Dhruv Mubayi
    [J]. Combinatorica, 2000, 20 : 441 - 444
  • [10] On-Line Edge-Coloring with a Fixed Number of Colors
    Monrad Favrholdt
    Nyhave Nielsen
    [J]. Algorithmica, 2003, 35 : 176 - 191
12345