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

DOI10.1137/1.9781611977073.88MaRDI QIDQ6575162

Karthekeyan Chandrasekaran, Calvin Beideman, Weihang Wang

Publication date: 19 July 2024

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

A polynomial time algorithm for finding a minimum 4-partition of a submodular function

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