Streaming Algorithms for 2-Coloring Uniform Hypergraphs

DOI10.1007/978-3-642-22300-6_57zbMath1342.05186OpenAlexW49889426MaRDI QIDQ5199282

Saswata Shannigrahi

Publication date: 12 August 2011

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-22300-6_57

zbMATH Keywords

randomized algorithmhypergraph coloringproperty Bstreaming algorithm

Mathematics Subject Classification ID

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

Related Items (1)

Better streaming algorithms for the maximum coverage problem

This page was built for publication: Streaming Algorithms for 2-Coloring Uniform Hypergraphs