Title :
Flows in undirected unit capacity networks
Author :
Goldberg, Andrew V. ; Rao, Satish
Author_Institution :
NEC Res. Inst., Princeton, NJ, USA
Abstract :
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=ω(n3/2), and upon a randomized bound of Karger when υ=Ω(n7/4/m 1/2)
Keywords :
computational complexity; graph theory; computation time; maximum flows; undirected networks; undirected unit capacity networks; IEL; Intelligent networks; National electric code; Partitioning algorithms;
Conference_Titel :
Foundations of Computer Science, 1997. Proceedings., 38th Annual Symposium on
Conference_Location :
Miami Beach, FL
Print_ISBN :
0-8186-8197-7
DOI :
10.1109/SFCS.1997.646090
