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

被引：0
|
作者：
Piotr Micek
Veit Wiechert
机构：
[1] Jagiellonian University,Theoretical Computer Science Department, Faculty of Mathematics and Computer Science
[2] Technische Universität Berlin,Institut für Mathematik
来源：
Algorithmica | 2017年 / 77卷
关键词：
On-line algorithm; Graph coloring; Bipartite graphs; 05C15; 05C85; 68R10;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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 P9\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$P_9$$\end{document}-free bipartite graphs.
引用
收藏
页码：1060 / 1070
页数：10
相关论文
共 50 条
  • [1] An On-line Competitive Algorithm for Coloring Bipartite Graphs Without Long Induced Paths
    Micek, Piotr
    Wiechert, Veit
    ALGORITHMICA, 2017, 77 (04) : 1060 - 1070
  • [2] A new algorithm for on-line coloring bipartite graphs
    Broersma, Hajo J.
    Capponi, Agostino
    Paulusma, Daniel
    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
    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
    Algorithmica, 2019, 81 : 3186 - 3199
  • [5] Approximately Coloring Graphs Without Long Induced Paths
    Chudnovsky, Maria
    Schaudt, Oliver
    Spirkl, Sophie
    Stein, Maya
    Zhong, Mingxian
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2017), 2017, 10520 : 193 - 205
  • [6] The complexity of coloring graphs without long induced paths
    Woeginger, Gerhard J.
    Sgall, Jiří
    Acta Cybernetica, 2001, 15 (01): : 107 - 117
  • [7] Approximately Coloring Graphs Without Long Induced Paths
    Chudnovsky, Maria
    Schaudt, Oliver
    Spirkl, Sophie
    Stein, Maya
    Zhong, Mingxian
    ALGORITHMICA, 2019, 81 (08) : 3186 - 3199
  • [8] Coloring graphs without short cycles and long induced paths
    Golovach, Petr A.
    Paulusma, Daniel
    Song, Jian
    DISCRETE APPLIED MATHEMATICS, 2014, 167 : 107 - 120
  • [9] Certifying coloring algorithms for graphs without long induced paths
    Kaminski, Marcin
    Pstrucha, Anna
    DISCRETE APPLIED MATHEMATICS, 2019, 261 : 258 - 267
  • [10] On-line coloring of H-free bipartite graphs
    Broersma, H. J.
    Capponi, A.
    Paulusma, D.
    ALGORITHMS AND COMPLEXITY, PROCEEDINGS, 2006, 3998 : 284 - 295
12345