A new approach to the maximum-flow problem
Journal of the ACM (JACM)
A fast parametric maximum flow algorithm and applications
SIAM Journal on Computing
An efficient algorithm for the minimum capacity cut problem
Mathematical Programming: Series A and B
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
An Õ(n2) algorithm for minimum cuts
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Derandomization through approximation: an NC algorithm for minimum cuts
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Augmenting undirected connectivity in RNC and in randomized Õ(n3) time
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Efficient splitting off algorithms for graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Global min-cuts in RNC, and other ramifications of a simple min-out algorithm
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Algorithms for graphic polymatroids and parametric s-Sets
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A combinatorial algorithm for minimizing symmetric submodular functions
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A representation for crossing set families with applications to submodular flow problems
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Experimental study of minimum cut algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Augmenting undirected edge connectivity in Õ(n2) time
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Computational Optimization and Applications
Fast Algorithms for Even/Odd Minimum Cuts and Generalizations
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
A distributed fault identification protocol for wireless and mobile ad hoc networks
Journal of Parallel and Distributed Computing
Exploiting form semantics and validation checks to improve e-form layout
International Journal of Web Engineering and Technology
SkyGraph: an algorithm for important subgraph discovery in relational graphs
Data Mining and Knowledge Discovery
Journal of Network and Systems Management
Graph Sparsification in the Semi-streaming Model
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
C&C: an effective algorithm for extracting web community cores
DASFAA'10 Proceedings of the 15th international conference on Database systems for advanced applications
TAGs: scalable threshold-based algorithms for proximity computation in graphs
Proceedings of the 14th International Conference on Extending Database Technology
On minimum changeover cost arborescences
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Finding maximal k-edge-connected subgraphs from a large graph
Proceedings of the 15th International Conference on Extending Database Technology
Hi-index | 0.01 |
We consider the problem of finding the minimum capacity cut in a network G with n nodes. This problem has applications to network reliability and survivability and is useful in subroutines for other network optimization problems. One can use a maximum flow problem to find a minimum cut separating a designated source node s from a designated sink node t, and by varying the sink node one can find a minimum cut in G as a sequence of at most 2n - 2 maximum flow problems. We then show how to reduce the running time of these 2n - 2 maximum flow algorithms to the running time for solving a single maximum flow problem. The resulting running time is O(nm log n2/m) for finding the minimum cut in either a directed or undirected network. The algorithm also determines the arc connectivity of either a directed or undirected network in O(nm) steps.