An On-line Competitive Algorithm for Coloring Bipartite Graphs Without Long Induced Paths

被引：3
|
作者：
Micek, Piotr [1 ,2 ]
Wiechert, Veit [2 ]
机构：
[1] Jagiellonian Univ, Theoret Comp Sci Dept, Fac Math & Comp Sci, Krakow, Poland
[2] Tech Univ Berlin, Inst Math, Berlin, Germany
来源：
ALGORITHMICA | 2017年 / 77卷 / 04期
关键词：
On-line algorithm; Graph coloring; Bipartite graphs; 1ST FIT;
D O I：
10.1007/s00453-016-0130-2
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
The existence of an on-line competitive algorithm for coloring bipartite graphs is a tantalizing open problem. So far there are only partial positive results for bipartite graphs with certain small forbidden graphs as induced subgraphs. We propose an on-line competitive coloring algorithm for -free bipartite graphs.
引用
收藏
页码：1060 / 1070
页数：11
相关论文
共 50 条
  • [1] An On-line Competitive Algorithm for Coloring Bipartite Graphs Without Long Induced Paths
    Piotr Micek
    Veit Wiechert
    [J]. Algorithmica, 2017, 77 : 1060 - 1070
  • [2] A new algorithm for on-line coloring bipartite graphs
    Broersma, Hajo J.
    Capponi, Agostino
    Paulusma, Daniel
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2008, 22 (01) : 72 - 91
  • [3] An On-line Competitive Algorithm for Coloring P8-free Bipartite Graphs
    Micek, Piotr
    Wiechert, Veit
    [J]. ALGORITHMS AND COMPUTATION, ISAAC 2014, 2014, 8889 : 516 - 527
  • [4] Approximately Coloring Graphs Without Long Induced Paths
    Maria Chudnovsky
    Oliver Schaudt
    Sophie Spirkl
    Maya Stein
    Mingxian Zhong
    [J]. Algorithmica, 2019, 81 : 3186 - 3199
  • [5] Approximately Coloring Graphs Without Long Induced Paths
    Chudnovsky, Maria
    Schaudt, Oliver
    Spirkl, Sophie
    Stein, Maya
    Zhong, Mingxian
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2017), 2017, 10520 : 193 - 205
  • [6] Approximately Coloring Graphs Without Long Induced Paths
    Chudnovsky, Maria
    Schaudt, Oliver
    Spirkl, Sophie
    Stein, Maya
    Zhong, Mingxian
    [J]. ALGORITHMICA, 2019, 81 (08) : 3186 - 3199
  • [7] Coloring graphs without short cycles and long induced paths
    Golovach, Petr A.
    Paulusma, Daniel
    Song, Jian
    [J]. DISCRETE APPLIED MATHEMATICS, 2014, 167 : 107 - 120
  • [8] Certifying coloring algorithms for graphs without long induced paths
    Kaminski, Marcin
    Pstrucha, Anna
    [J]. DISCRETE APPLIED MATHEMATICS, 2019, 261 : 258 - 267
  • [9] On-line coloring of H-free bipartite graphs
    Broersma, H. J.
    Capponi, A.
    Paulusma, D.
    [J]. ALGORITHMS AND COMPLEXITY, PROCEEDINGS, 2006, 3998 : 284 - 295
  • [10] On the complexity of 4-coloring graphs without long induced paths
    Le, Van Bang
    Randerath, Bert
    Schiermeyer, Ingo
    [J]. THEORETICAL COMPUTER SCIENCE, 2007, 389 (1-2) : 330 - 335
12345