On the Euclidean two paths problem

DOI10.1016/0166-218X(93)90089-7zbMath0789.68112OpenAlexW2099305443MaRDI QIDQ1315995

Gerhard J. Woeginger, Hans Kellerer

Publication date: 17 March 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(93)90089-7

zbMATH Keywords

Euclidean two paths problemnonintersecting polygonal obstacles in Euclidean plane

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• A Polynomial Solution to the Undirected Two Paths Problem
• Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Euclidean two paths problem