Deterministic enumeration of all minimum cut-sets and \(k\)-cut-sets in hypergraphs for fixed \(k\)

DOI10.1007/s10107-023-02013-8MaRDI QIDQ6608037

Weihang Wang, Karthekeyan Chandrasekaran, Calvin Beideman

Publication date: 19 September 2024

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Deterministic enumeration of all minimum cut-sets and \(k\)-cut-sets in hypergraphs for fixed \(k\)