Computing edge-connectivity in multigraphs and capacitated graphs
SIAM Journal on Discrete Mathematics
Derandomization through approximation: an NC algorithm for minimum cuts
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Random sampling in cut, flow, and network design problems
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Two recent algorithms for the global minimum cut problem
ACM SIGACT News
A new approach to the minimum cut problem
Journal of the ACM (JACM)
Journal of the ACM (JACM)
On the greedy heuristic for matchings
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Using randomized sparsification to approximate minimum cuts
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Dynamic Graph Algorithms with Applications
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
A Unified Framework for Approximating Multiway Partition Problems
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Graph connectivity and its augmentation: applications of MA orderings
Discrete Applied Mathematics
Minimum Cuts of Simple Graphs in Almost Always Linear Time
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
$O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time
SIAM Journal on Computing
A simple and fast min-cut algorithm
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |