Computing minimum cuts in hypergraphs

DOI10.1137/1.9781611974782.70zbMath1410.05198arXiv1607.08682OpenAlexW2491454164MaRDI QIDQ4575811

Chandra Chekuri, Chao Xu

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.08682

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items

Minimum Cuts and Sparsification in Hypergraphs ⋮ Faster connectivity in low-rank hypergraphs via expander decomposition ⋮ Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions ⋮ Using edge cuts to find Euler tours and Euler families in hypergraphs ⋮ Hypergraph \(k\)-cut in randomized polynomial time ⋮ On the sizes of vertex-\(k\)-maximal \(r\)-uniform hypergraphs ⋮ On some algorithmic aspects of hypergraphic matroids