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
A Simple and Fast Min-Cut Algorithm
Theory of Computing Systems
| Hi-index | 0.00 |
In this paper we prove, that the minimum cut algorithm presented previously by the author (Brinkmeier 07), requires only linear time with high probability, if the input graph if chosen randomly from the graphs with constant expected degree. In fact a more general lower bound for the probability of a low runtime depending on several parameters is given.