Abstract

Consider an n-vertex, m-edge, undirected graph with maximum flow value v. We give a method to find augmenting paths in such a graph in amortized sub-linear (O(npv)) time per path. This lets us improve the time bound of the classic augmenting path algorithm to O(m+ nv3=2) on simple graphs. The addition of a blocking flow subroutine gives a simple, deterministic O(nm2=3v1=6)-time algorithm. We also use our technique to improve known randomized algorithms, giving O(m+nv5=4)-time and O(m+n11=9v)-time algorithms for capacitated undirected graphs. For simple graphs, in which v n, the last bound is O(n2:2), improving on the best previous bound of O(n2:5), which is also the best known time bound for bipartite matching.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.