On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary

Authors:
Werner Schwärzler
Affiliations:
FRA AS/N, Lufthansa Systems, Am Prime Parc 1, D-65479, Raunheim, Germany
Venue:
Combinatorica
Year:
2009

Citing 0
Cited 2

Adding one edge to planar graphs makes crossing number hard

Proceedings of the twenty-sixth annual symposium on Computational geometry
Multiflows in symmetric digraphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown that both the undirected and the directed edge-disjoint paths problem are NP-complete, if the supply graph is planar and all edges of the demand graph are incident with vertices lying on the outer boundary of the supply graph. In the directed case, the problem remains NP-complete, if in addition the supply graph is acyclic. The undirected case solves open problem no. 56 of A. Schrijver’s book Combinatorial Optimization.