Algorithms – ESA 2005
From MaRDI portal
Publication:5475826
DOI10.1007/11561071zbMath1162.05352OpenAlexW2501059503MaRDI QIDQ5475826
Publication date: 27 June 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11561071
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
The crossing number of a projective graph is quadratic in the face–width ⋮ Approximation algorithms via contraction decomposition ⋮ Splitting (complicated) surfaces is hard
This page was built for publication: Algorithms – ESA 2005
