Abstract

We prove: The directed edge-disjoint paths problem is NP-complete, even if (a) the underlying graph G is acyclic, the demand graph H consists just of three sets of parallel edges and G + H is Eulerian, or (b) G + H is planar, or (c) G is planar and acyclic. (d) The undirected edge-disjoint paths problem is NP-complete, even if G + H is Eulerian and H consists just of three sets of parallel edges.

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 call

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.