Vertex Disjoint Paths in Upward Planar Graphs
DOI10.1007/978-3-319-06686-8_5zbMath1408.68105arXiv1312.1526MaRDI 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
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C38: Paths and cycles
05C10: Planar graphs; geometric and topological aspects of graph theory
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
05C20: Directed graphs (digraphs), tournaments
Related Items
