Abstract
This paper gives the first o(n2.5) deterministic algorithm for the maximum flow problem in any undirected unit-capacity graph with no parallel edges. In an n-vertex, m-edge graph with maximum flow value v, our running time is O(n9/4v1/8) = O(n2.375). Note that v ≤ n for simple unit-capacity graphs. The previous deterministic algorithms [Karger and Levine 1998] achieve O(m+nv3/2) and O(nm2/3v1/6) time bound, which are both O(n2.5) for dense simple graphs and v = Θ(n).
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
