Minimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions

DOI10.1137/1.9781611975482.54zbMath1431.68137OpenAlexW4250100115MaRDI QIDQ5236238

Debmalya Panigrahi, Kyle Fox, Fred Zhang

Publication date: 15 October 2019

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

Full work available at URL: https://doi.org/10.1137/1.9781611975482.54

Mathematics Subject Classification ID

Hypergraphs (05C65) Randomized algorithms (68W20)

Related Items (3)

Faster connectivity in low-rank hypergraphs via expander decomposition ⋮ Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions ⋮ Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time

This page was built for publication: Minimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions