Monte-Carlo approximation algorithms for enumeration problems
Journal of Algorithms
An Õ(n2) algorithm for minimum cuts
STOC '93 Proceedings of the twenty-fifth 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
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A new approach to the minimum cut problem
Journal of the ACM (JACM)
An $\NC$ Algorithm for Minimum Cuts
SIAM Journal on Computing
Experimental study of minimum cut algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
The Combinatorics of Network Reliability
The Combinatorics of Network Reliability
The resilience of WDM networks to probabilistic geographical failures
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |