A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs
Authors:
- 25 June 1999
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 164-173
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- 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
- Minimum cuts in near-linear time1996
- On minimum 3-cuts and approximating k-cuts using Cut Trees1996
- A Faster Algorithm for Finding the Minimum Cut in a Directed GraphJournal of Algorithms, 1994
- 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
- An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut ProblemSIAM Journal on Algebraic Discrete Methods, 1985
- An efficient algorithm for K shortest simple pathsNetworks, 1982
- Network Flow and Testing Graph ConnectivitySIAM Journal on Computing, 1975