Abstract
Let G = ( V, E) be an undirected planar graph, and s, t ϵ V, s ≠ t. We present a linear algorithm to compute a set of edge-disjoint ( s, t)-paths of maximum cardinality in G. In other words, the problem is to find a maximum unit flow from s to t in a non-weighted graph. The main purpose is not to show that this problem can be solved by a linear algorithm, since such an algorithm was recently presented by Weihe (1994), but to propose a linear algorithm easier to understand and to justify, and implemented much more easily than Weihe's.
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.
