Online coloring of hypergraphs
From MaRDI portal
Publication:656575
DOI10.1016/J.IPL.2010.03.001zbMATH Open1229.68082OpenAlexW1998650435MaRDI QIDQ656575FDOQ656575
Authors: Magnús M. Halldórsson
Publication date: 18 January 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.03.001
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)
Cites Work
Cited In (12)
- Online edge coloring via tree recurrences and correlation decay
- Online Bounded Coloring of Permutation and Overlap Graphs
- Online chromatic number is PSPACE-complete
- On-line algorithms for 2-coloring hypergraphs via chip games
- Online Dual Edge Coloring of Paths and Trees
- Online vertex-coloring games in random graphs
- Online hypergraph coloring with rejection
- Randomized online graph coloring
- Title not available (Why is that?)
- Online hypergraph coloring
- Online multi-coloring on the path revisited
- Online coloring co-interval graphs
This page was built for publication: Online coloring of hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656575)