On the Advice Complexity of the Online L(2,1)-Coloring Problem on Paths and Cycles
From MaRDI portal
Publication:4925225
DOI10.1007/978-3-642-38768-5_7zbMath1381.68095OpenAlexW183658320MaRDI QIDQ4925225
Juraj Hromkovič, Maria Paola Bianchi, Sacha Krug, Björn Steffen, Hans-Joachim Böckenhauer
Publication date: 11 June 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38768-5_7
Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)
Related Items (5)
Online Multi-Coloring 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 ⋮ Online bin packing with advice
This page was built for publication: On the Advice Complexity of the Online L(2,1)-Coloring Problem on Paths and Cycles
