On-line edge-coloring with a fixed number of colors

被引：0

作者：

Favrholdt, LM ^{[1
]}

Nielsen, MN ^{[1
]}

机构：

[1] Univ So Denmark, Dept Math & Comp Sci, Odense, Denmark

来源：

FST TCS 2000: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS | 2000年 / 1974卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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.

引用

页码：106 / 116

页数：11

共 50 条

[41] Edge-coloring almost bipartite multigraphs
Feder, Tomas
Subi, Carlos
[J]. INFORMATION PROCESSING LETTERS, 2013, 113 (18) : 685 - 689
[42] A COMPARISON OF 2 EDGE-COLORING FORMULATIONS
LEE, J
LEUNG, J
[J]. OPERATIONS RESEARCH LETTERS, 1993, 13 (04) : 215 - 223
[43] Strong edge-coloring of planar graphs
Hudak, David
Luzar, Borut
Sotak, Roman
Skrekovski, Riste
[J]. DISCRETE MATHEMATICS, 2014, 324 : 41 - 49
[44] Star edge-coloring of square grids
Holub, Premysl
Luzar, Borut
Mihalikova, Erika
Mockovciakova, Martina
Sotak, Roman
[J]. APPLIED MATHEMATICS AND COMPUTATION, 2021, 392
[45] Strong edge-coloring for jellyfish graphs
Chang, Gerard J.
Chen, Sheng-Hua
Hsu, Chi-Yun
Hung, Chia-Man
Lai, Huei-Ling
[J]. DISCRETE MATHEMATICS, 2015, 338 (12) : 2348 - 2355
[46] Algorithm for the cost edge-coloring of trees
Zhou, X
Nishizeki, T
[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2004, 8 (01) : 97 - 108
[47] Revisiting semistrong edge-coloring of graphs
Luzar, Borut
Mockovciakova, Martina
Sotak, Roman
[J]. JOURNAL OF GRAPH THEORY, 2024, 105 (04) : 612 - 632
[48] Algorithm for the Cost Edge-Coloring of Trees
Xiao Zhou
Takao Nishizeki
[J]. Journal of Combinatorial Optimization, 2004, 8 : 97 - 108
[49] RECENT PROGRESS ON EDGE-COLORING GRAPHS
HILTON, AJW
[J]. DISCRETE MATHEMATICS, 1987, 64 (2-3) : 303 - 307
[50] An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem
Matsumoto, Yusuke
Kamiyama, Naoyuki
Imai, Keiko
[J]. INFORMATION PROCESSING LETTERS, 2011, 111 (10) : 465 - 468

← 1 2 3 4 5 →