Counting and enumerating optimum cut sets for hypergraph \(k\)-partitioning problems for fixed \(k\)

DOI10.4230/lipics.icalp.2022.16MaRDI QIDQ6560800

Calvin Beideman, Weihang Wang, Karthekeyan Chandrasekaran

Publication date: 24 June 2024

zbMATH Keywords

enumerationcountinghypergraphs\(k\)-partitioning

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (2)

A polynomial time algorithm for finding a minimum 4-partition of a submodular function ⋮ Deterministic enumeration of all minimum cut-sets and \(k\)-cut-sets in hypergraphs for fixed \(k\)

This page was built for publication: Counting and enumerating optimum cut sets for hypergraph \(k\)-partitioning problems for fixed \(k\)