Online Coloring of Bipartite Graphs with and without Advice
From MaRDI portal
Publication:2914354
DOI10.1007/978-3-642-32241-9_44zbMath1314.68403OpenAlexW2174163148MaRDI QIDQ2914354
Juraj Hromkovič, Lucia Keller, Maria Paola Bianchi, Hans-Joachim Böckenhauer
Publication date: 25 September 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://doc.rero.ch/record/326369/files/453_2013_Article_9819.pdf
Related Items (13)
Online Multi-Coloring with Advice ⋮ On Energy-Efficient Computations With Advice ⋮ A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey ⋮ On the advice complexity of online bipartite matching and online stable marriage ⋮ Fully Online Matching with Advice on General Bipartite Graphs and Paths ⋮ On the list update problem with advice ⋮ On the advice complexity of the online dominating set problem ⋮ On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles ⋮ The string guessing problem as a method to prove lower bounds on the advice complexity ⋮ Towards using the history in online computation with advice ⋮ On Advice Complexity of the k-server Problem under Sparse Metrics ⋮ Online multi-coloring with advice ⋮ Online bin packing with advice
This page was built for publication: Online Coloring of Bipartite Graphs with and without Advice
