Online Graph Coloring with Advice and Randomized Adversary
From MaRDI portal
Publication:2794362
DOI10.1007/978-3-662-49192-8_19zbMath1442.68271OpenAlexW2316420903MaRDI QIDQ2794362
Juraj Hromkovič, Elisabet Burjons, Walter Unger, Xavier Muñoz
Publication date: 10 March 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49192-8_19
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)
Related Items (4)
Fully Online Matching with Advice on General Bipartite Graphs and Paths ⋮ Online Matching in Regular Bipartite Graphs with Randomized Adversary ⋮ Tight bounds for online coloring of basic graph classes ⋮ Tight Bounds for Online Coloring of Basic Graph Classes
This page was built for publication: Online Graph Coloring with Advice and Randomized Adversary