Finding minimum 3-way cuts in hypergraphs
Author:
- 1 July 2010
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 110 (14-15) , 554-558
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A Deterministic Algorithm for Finding All Minimum k‐Way CutsSIAM Journal on Computing, 2007
- A Divide-and-Conquer Approach to the Minimum k -Way Cut ProblemAlgorithmica, 2002
- A fast hypergraph min-cut algorithm for circuit partitioningIntegration, 2000
- Multilevel k‐way Hypergraph PartitioningVLSI Design, 1999
- A new and improved algorithm for the 3-cut problemOperations Research Letters, 1997
- 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
- Computing Edge-Connectivity in Multigraphs and Capacitated GraphsSIAM Journal on Discrete Mathematics, 1992
- A new approach to the maximum-flow problemJournal of the ACM, 1988
- Cutsets and partitions of hypergraphsNetworks, 1973