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 条
  • [21] Edge-coloring of multigraphs
    Kochol, M
    Krivonaková, N
    Smejová, S
    [J]. DISCRETE MATHEMATICS, 2005, 300 (1-3) : 229 - 234
  • [22] EXTENDING AN EDGE-COLORING
    MARCOTTE, O
    SEYMOUR, PD
    [J]. JOURNAL OF GRAPH THEORY, 1990, 14 (05) : 565 - 573
  • [23] ON EDGE-COLORING GRAPHS
    HOFFMAN, T
    MITCHEM, J
    SCHMEICHEL, E
    [J]. ARS COMBINATORIA, 1992, 33 : 119 - 128
  • [24] Strong edge-coloring of graphs with maximum degree 4 using 22 colors
    Cranston, Daniel W.
    [J]. DISCRETE MATHEMATICS, 2006, 306 (21) : 2772 - 2778
  • [25] Note – Edge-Coloring Cliques with Three Colors on All 4-Cliques
    Dhruv Mubayi
    [J]. Combinatorica, 1998, 18 : 293 - 296
  • [26] An explicit edge-coloring of Kn with six colors on every K5
    Cameron, Alex
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2019, 26 (04):
  • [27] ON THE 1.1 EDGE-COLORING OF MULTIGRAPHS
    NISHIZEKI, T
    KASHIWAGI, K
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 1990, 3 (03) : 391 - 410
  • [28] Some topics on edge-coloring
    Liu, Guizhen
    Xu, Changqing
    [J]. DISCRETE GEOMETRY, COMBINATORICS AND GRAPH THEORY, 2007, 4381 : 101 - +
  • [29] On the simultaneous edge-coloring conjecture
    Hajiaghaee, MT
    Mahmoodian, ES
    Mirrokni, VS
    Saberi, A
    Tusserkani, R
    [J]. DISCRETE MATHEMATICS, 2000, 216 (1-3) : 267 - 272
  • [30] Edge-coloring bipartite graphs
    Kapoor, A
    Rizzi, R
    [J]. JOURNAL OF ALGORITHMS, 2000, 34 (02) : 390 - 396
12345