Locating sources to meet flow demands in undirected networks
Journal of Algorithms
Locating Sources to Meet Flow Demands in Undirected Networks
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
On computing minimum (s,t)-cuts in digraphs
Information Processing Letters
Optimal capacity expansion arc algorithm on networks
CIS'04 Proceedings of the First international conference on Computational and Information Science
Quantum algorithms for matching and network flows
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Mining structural hole spanners through information diffusion in social networks
Proceedings of the 22nd international conference on World Wide Web
| Hi-index | 0.00 |
We describe an O(min(m,n3/2)m1/2)-time algorithm for finding maximum flows in undirected networks with unit capacities and no parallel edges. This improves upon the previous bound of Karzanov and Even and Tarjan when $m = \omega(n^{3/2})$, and upon a randomized bound of Karger when $v = \Omega(n^{7/4}/m^{1/2})$.