The Community for Technology Leaders
2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1997)
Miami Beach, FL
Oct. 19, 1997 to Oct. 22, 1997
ISSN: 0272-5428
ISBN: 0-8186-8197-7
pp: 32
S. Rao , NEC Res. Inst., Princeton, NJ, USA
A.V. Goldberg , NEC Res. Inst., Princeton, NJ, USA
ABSTRACT
We describe an O(min(m, n/sup 3/2/)m/sup 1/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=/spl omega/(n/sup 3/2/), and upon a randomized bound of Karger when /spl upsi/=/spl Omega/(n/sup 7/4//m/sup 1/2/).
INDEX TERMS
graph theory; undirected unit capacity networks; maximum flows; undirected networks; computation time
CITATION
S. Rao, A.V. Goldberg, "Flows in undirected unit capacity networks", 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, vol. 00, no. , pp. 32, 1997, doi:10.1109/SFCS.1997.646090
92 ms
(Ver 3.3 (11022016))