Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Approximating s-t minimum cuts in Õ(n2) time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Minimum cuts in near-linear time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Using random sampling to find maximum flows in uncapacitated undirected graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Random Sampling in Cut, Flow, and Network Design Problems
Mathematics of Operations Research
Graph Algorithms
Beyond the flow decomposition barrier
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Flows in undirected unit capacity networks
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Finding maximum flows in undirected graphs seems easier than bipartite matching
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Random sampling in residual graphs
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Dynamic Graph Algorithms with Applications
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Maximum Bipartite Flow in Networks with Adaptive Channel Width
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Maximum bipartite flow in networks with adaptive channel width
Theoretical Computer Science
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
Proceedings of the forty-third annual ACM symposium on Theory of computing
A new approach to computing maximum flows using electrical flows
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |