Online hypergraph coloring
From MaRDI portal
Publication:975516
DOI10.1016/j.ipl.2008.08.009zbMath1191.68885OpenAlexW1995085955MaRDI QIDQ975516
Csanád Imreh, Judit Nagy-György
Publication date: 9 June 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.08.009
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Online algorithms; streaming algorithms (68W27)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Online algorithms. The state of the art
- An on-line graph coloring algorithm with sublinear performance ratio
- On-line coloring \(k\)-colorable graphs
- On-Line Coloring of H-Free Bipartite Graphs
- On-line and first fit colorings of graphs
- Randomized online graph coloring
- Graph Coloring with Rejection
This page was built for publication: Online hypergraph coloring