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

DOI10.1007/s00493-009-2407-4OpenAlexW2030101236MaRDI QIDQ2149491

Werner Schwärzler

Publication date: 29 June 2022

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-009-2407-4

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Related Items

Linkage on the infinite grid ⋮ Multiflows in symmetric digraphs ⋮ Unnamed Item

Cites Work

• Edge-disjoint paths in planar graphs
• Multicommodity flows in planar graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• NP-completeness of some edge-disjoint paths problems
• On the complexity of the disjoint paths problem