On-Line Edge-Coloring with a Fixed Number of Colors

被引:0
|
作者
Monrad Favrholdt
Nyhave Nielsen
机构
[1] Department of Mathematics and Computer Science,
[2] University of Southern Denmark,undefined
[3] Campusvej 55,undefined
[4] DK-5230 Odense M,undefined
[5] lenem@imada.sdu.dk,undefined
[6] nyhave@imada.sdu.dk.,undefined
来源
Algorithmica | 2003年 / 35卷
关键词
Edge-coloring; On-line algorithms; Competitive analysis; Fixed number of colors; Maximization problem; Fair algorithms; k -Colorable graphs; Accommodating sequences; Restricted adversary; Randomization;
D O I
暂无
中图分类号
学科分类号
摘要
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors available and the aim is to color as many edges as possible. We prove upper and lower bounds on the performance of different classes of algorithms for the problem. Moreover, we determine the performance of two specific algorithms, First-Fit and Next-Fit .
引用
收藏
页码:176 / 191
页数:15
相关论文
共 50 条
  • [1] On-line edge-coloring with a fixed number of colors
    Favrholdt, LM
    Nielsen, MN
    [J]. FST TCS 2000: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2000, 1974 : 106 - 116
  • [2] On-line edge-coloring with a fixed number of colors
    Favrholdt, LM
    Nielsen, MN
    [J]. ALGORITHMICA, 2003, 35 (02) : 176 - 191
  • [3] Improved edge-coloring with three colors
    Kowalik, Lukasz
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2006, 4271 : 90 - 101
  • [4] Improved edge-coloring with three colors
    Kowalik, Lukasz
    [J]. THEORETICAL COMPUTER SCIENCE, 2009, 410 (38-40) : 3733 - 3742
  • [5] Edge-coloring cliques with many colors on subcliques
    Eichhorn, D
    Mubayi, D
    [J]. COMBINATORICA, 2000, 20 (03) : 441 - 444
  • [6] INTERVAL EDGE-COLORING OF A GRAPH WITH FORBIDDEN COLORS
    KUBALE, M
    [J]. DISCRETE MATHEMATICS, 1993, 121 (1-3) : 135 - 143
  • [7] 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
  • [8] Online edge coloring of paths and trees with a fixed number of colors
    Lene M. Favrholdt
    Jesper W. Mikkelsen
    [J]. Acta Informatica, 2018, 55 : 57 - 80
  • [9] Online edge coloring of paths and trees with a fixed number of colors
    Favrholdt, Lene M.
    Mikkelsen, Jesper W.
    [J]. ACTA INFORMATICA, 2018, 55 (01) : 57 - 80
  • [10] 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