Online Conflict-Free Colorings for Hypergraphs

DOI10.1007/978-3-540-73420-8_21zbMath1171.05422OpenAlexW2104639020MaRDI QIDQ5428811

Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky

Publication date: 28 November 2007

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73420-8_21

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)

Related Items (5)

Conflict-Free Colourings of Uniform Hypergraphs With Few Edges ⋮ Homotopy and Hom construction in the category of finite hypergraphs ⋮ Dynamic Offline Conflict-Free Coloring for Unit Disks ⋮ Online hypergraph coloring with rejection ⋮ Dynamic Conflict-Free Colorings in the Plane

This page was built for publication: Online Conflict-Free Colorings for Hypergraphs