Abstract
Let G be a directed planar graph of complexity n , each arc having a nonnegative length. Let s and t be two distinct faces of G let s 1 ,…, s k be vertices incident with s let t 1 ,…, t k be vertices incident with t . We give an algorithm to compute k pairwise vertex-disjoint paths connecting the pairs ( s i , t i ) in G , with minimal total length, in O ( kn log n ) time.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.