Online coloring of bipartite graphs with and without advice
type: Item
instance of: scholarly article
title: Online coloring of bipartite graphs with and without advice
zbMATH Open document ID: 1314.68404
author: Maria Paola Bianchi
author: Hans-Joachim Böckenhauer
author: Lucia Keller
author: Juraj Hromkovič
published in: Algorithmica
publication date: 2015-01-19T00:00:00Z
full work available at URL: 453 2013 Article 9819.pdf
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6387681
zbMATH Keywords: online coloring
zbMATH Keywords: lower bounds
zbMATH Keywords: advice complexity
zbMATH Keywords: bipartite graph
describes a project that uses: OEIS
MaRDI profile type: Publication
OpenAlex ID: W2038445565
cites work: Effective coloration
cites work: On the Advice Complexity of the Knapsack Problem
cites work: On the Advice Complexity of Online Problems
cites work: Q4223058
cites work: How Much Information about the Future Is Needed?
cites work: Universal codeword sets and representations of the integers
cites work: Online Computation with Advice
cites work: Q4440308
cites work: Advice Complexity of Online Coloring for Paths
cites work: On-line and first fit colorings of graphs
cites work: Information Complexity of Online Problems
cites work: Q4249728
cites work: Q4010310
cites work: Advice Complexity and Barely Random Algorithms
cites work: An on-line graph coloring algorithm with sublinear performance ratio
cites work: Randomized online graph coloring
DOI: 10.1007/S00453-013-9819-7
description: scientific article; zbMATH DE number 6387681