Abstract
Given a planar graph G = ( V, E), find k edge-disjoint paths in G connecting k pairs of terminals specified on the outer face of G. Generalizing earlier results of Okamura and Seymour ( J. Combin. Theory Ser. B 31 (1981), 75–81) and of the author ( Combinatorica 2, No. 4 (1982), 361–371), we solve this problem when each node of G not on the outer face has even degree. The solution involves a good characterization for the solvability and the proof gives rise to an algorithm of complexity O(| V| 3log| V|). In particular, the integral multicommodity flow problem is proved to belong to the problem class P when the underlying graph is outerplanar.
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.
