Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k
- 12 September 2023
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 207 (1-2) , 329-367
Abstract
No abstract availableKeywords
Funding Information
- Division of Computing and Communication Foundations (AF-1814613, AF-1907937)
This publication has 39 references indexed in Scilit:
- Finding minimum 3-way cuts in hypergraphsInformation Processing Letters, 2010
- Approximating k-cuts using network strength as a Lagrangean relaxationEuropean Journal of Operational Research, 2008
- A Deterministic Algorithm for Finding All Minimum k‐Way CutsSIAM Journal on Computing, 2007
- Minimum cuts in near-linear timeJournal of the ACM, 2000
- Edge-augmentation of hypergraphsMathematical Programming, 1999
- On the number of small cuts in a graphInformation Processing Letters, 1996
- A new approach to the minimum cut problemJournal of the ACM, 1996
- Minimizing submodular functions over families of setsCombinatorica, 1995
- A Combinatorial Decomposition TheoryCanadian Journal of Mathematics, 1980
- Cutsets and partitions of hypergraphsNetworks, 1973