On Shortest Disjoint Paths in Planar Graphs

DOI10.1007/978-3-642-10631-6_31zbMath1272.05203OpenAlexW1605956573MaRDI QIDQ3652216

Yusuke Kobayashi, Christian Sommer

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_31

zbMATH Keywords

algorithmshortest disjoint paths problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Walking through waypoints ⋮ Min-sum 2-paths problems

This page was built for publication: On Shortest Disjoint Paths in Planar Graphs