Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings
- 1 January 2010
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 15-28
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A Deterministic Algorithm for Finding All Minimum k‐Way CutsSIAM Journal on Computing, 2007
- Multiway cuts in node weighted graphsJournal of Algorithms, 2004
- On decomposing a hypergraph into k connected sub-hypergraphsDiscrete Applied Mathematics, 2003
- A fast hypergraph min-cut algorithm for circuit partitioningIntegration, 2000
- On the Complexity of Constructing Evolutionary TreesJournal of Combinatorial Optimization, 1999
- A new approach to the minimum cut problemJournal of the ACM, 1996
- A Polynomial Algorithm for the k-cut Problem for Fixed kMathematics of Operations Research, 1994
- A new approach to the maximum-flow problemJournal of the ACM, 1988
- Cutsets and partitions of hypergraphsNetworks, 1973
- A generalization of Kónig's theoremActa Mathematica Hungarica, 1970