Abstract
We consider the following problem. Let G=(V, E) be an undirected planar graph and let s, t∈V, s≠t. The problem is to find a set of pairwise edge-disjoint paths, each connecting s with t, with maximum cardinality. In other words, the problem is to find a maximum unit flow from s to t. The fastest algorithm in the literature has running time O(|V|log|V|)(¦V¦ log ¦V¦). In this paper now, we give a linear time algorithm.KeywordsPlanar GraphLinear TimeUnit FlowOuter FaceSearch PathThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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.
