Vertex Disjoint Paths in Upward Planar Graphs

DOI10.1007/978-3-319-06686-8_5zbMath1408.68105arXiv1312.1526OpenAlexW1673759067MaRDI QIDQ4981149

Ali Golshani, Stephan Kreutzer, Sebastian Siebertz, Saeed Akhoondian Amiri

Publication date: 24 June 2014

Published in: Computer Science - Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.1526

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) 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) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Routing with congestion in acyclic digraphs ⋮ Walking through waypoints

This page was built for publication: Vertex Disjoint Paths in Upward Planar Graphs