An on-line competitive algorithm for coloring bipartite graphs without long induced paths
type: Item
instance of: scholarly article
title: An on-line competitive algorithm for coloring bipartite graphs without long induced paths
zbMATH Open document ID: 1360.05065
author: Piotr Micek
author: Veit Wiechert
published in: Algorithmica
publication date: 2017-05-02T00:00:00Z
full work available at URL: http://depositonce.tu-berlin.de/handle/11303/6664
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W27
zbMATH DE Number: 6710368
zbMATH Keywords: on-line algorithm
zbMATH Keywords: graph coloring
zbMATH Keywords: bipartite graphs
MaRDI profile type: Publication
OpenAlex ID: W1491462073
Wikidata QID: Q59529322
cites work: The relative worst order ratio for online algorithms
cites work: On-Line Coloring of H-Free Bipartite Graphs
cites work: A New Algorithm for On-line Coloring Bipartite Graphs
cites work: Lower Bounds for On-line Graph Colorings
cites work: On-line 3-chromatic graphs. II: Critical graphs
cites work: On-line and first fit colorings of graphs
cites work: Q3496352
cites work: Q4249728
cites work: On-Line Coloring and Recursive Graph Theory
cites work: On-Line and First-fit Coloring of Graphs that Do Not Induce $P_5 $
cites work: Q3950561
cites work: An on-line graph coloring algorithm with sublinear performance ratio
cites work: An On-line Competitive Algorithm for Coloring $$P_8$$-free Bipartite Graphs
DOI: 10.1007/S00453-016-0130-2
description: scientific article; zbMATH DE number 6710368