Efficient Algorithms for the Problems of Enumerating Cuts by Non-decreasing Weights
- 14 February 2009
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 56 (3) , 297-312
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- A Divide-and-Conquer Approach to the Minimum k -Way Cut ProblemAlgorithmica, 2002
- Practical Performance of Efficient Minimum Cut AlgorithmsAlgorithmica, 2000
- Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run TimeJournal of Algorithms, 1999
- A new and improved algorithm for the 3-cut problemOperations Research Letters, 1997
- 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
- Network Flows: Theory, Algorithms, and Applications.Journal of the Operational Research Society, 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
- Multi-Terminal Network FlowsJournal of the Society for Industrial and Applied Mathematics, 1961