Non-crossing Paths with Geographic Constraints
DOI10.1007/978-3-319-73915-1_35zbMath1503.68233arXiv1708.05486MaRDI QIDQ4625135
Bettina Speckmann, Kevin Verbeek, Rodrigo I. Silveira
Publication date: 20 February 2019
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.05486
68Q25: Analysis of algorithms and problem complexity
05C82: Small world graphs, complex networks (graph-theoretic aspects)
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C62: Graph representations (geometric and intersection representations, etc.)
