Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems
- 21 December 2010
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 62 (3-4) , 787-806
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Finding minimum 3-way cuts in hypergraphsInformation Processing Letters, 2010
- Submodular function minimizationMathematical Programming, 2007
- A Deterministic Algorithm for Finding All Minimum k‐Way CutsSIAM Journal on Computing, 2007
- Multiway cuts in node weighted graphsJournal of Algorithms, 2004
- A fast hypergraph min-cut algorithm for circuit partitioningIntegration, 2000
- A simple min-cut algorithmJournal of the ACM, 1997
- A new approach to the minimum cut problemJournal of the ACM, 1996
- Applications of submodular functions1993
- A new approach to the maximum-flow problemJournal of the ACM, 1988
- Cutsets and partitions of hypergraphsNetworks, 1973