Algorithms and Computation

DOI10.1007/11602613zbMath1175.05041OpenAlexW2304246803MaRDI QIDQ5897893

Étienne Schramm, Alexander Wolff, Andreas Spillner, Christian Knauer

Publication date: 14 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11602613

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Configurations with few crossings in topological graphs

This page was built for publication: Algorithms and Computation