A new approach to the maximum-flow problem
Journal of the ACM (JACM)
An efficient algorithm for the minimum capacity cut problem
Mathematical Programming: Series A and B
Computing edge-connectivity in multigraphs and capacitated graphs
SIAM Journal on Discrete Mathematics
A matroid approach to finding edge connectivity and packing arborescences
Selected papers of the 23rd annual ACM symposium on Theory of computing
Implementing an efficient minimum capacity cut algorithm
Mathematical Programming: Series A and B
A new approach to the minimum cut problem
Journal of the ACM (JACM)
Minimum cuts in near-linear time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
A linear time 2 + &&egr; approximation algorithm for edge connectivity
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
Computing All Small Cuts in Undirected Networks
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Graph connectivity and its augmentation: applications of MA orderings
Discrete Applied Mathematics
Communities in graphs and hypergraphs
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
| Hi-index | 0.00 |
We present an algorithm which calculates a minimum cut and its weight in an undirected graph with nonnegative real edge weights, n vertices and m edges, in time $O(max(log n, min(m/n, \delta_{G}/\varepsilon))n^2)$, where ε is the minimal edge weight, and δG the minimal weighted degree. For integer edge weights this time is further improved to O(δGn2) and O(λGn2). In both cases these bounds are improvements of the previously known best bounds of deterministic algorithms. These were O(nm + log nn2) for real edge weights and O(nM+n2) and O(M+λGn2) for integer weights, where M is the sum of all edge weights.