New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting

DOI10.1007/978-3-642-29344-3_35zbMath1353.68129OpenAlexW9065265MaRDI QIDQ2894484

Saket Saurabh, Sudeshna Kolay, Archontia C. Giannopoulou

Publication date: 29 June 2012

Published in: LATIN 2012: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29344-3_35

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (3)

Large Independent Sets in Subquartic Planar Graphs ⋮ Large Independent Sets in Triangle-Free Planar Graphs ⋮ Hypergraph cuts above the average

This page was built for publication: New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting