Improved Algorithms for the Point-Set Embeddability Problem for Plane 3-Trees
From MaRDI portal
Publication:3087951
DOI10.1007/978-3-642-22685-4_18zbMath1353.68215arXiv1012.0230OpenAlexW1692509211MaRDI QIDQ3087951
Tanaeem M. Moosa, M. Sohel Rahman
Publication date: 17 August 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1012.0230
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
Point-set embeddings of plane \(3\)-trees ⋮ A Note on Universal Point Sets for Planar Graphs ⋮ Plane 3-Trees: Embeddability and Approximation ⋮ THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS
This page was built for publication: Improved Algorithms for the Point-Set Embeddability Problem for Plane 3-Trees
