Abstract
A point set P∈⊆∈R 2 is universal for a class G if every graph of has a planar straight-line embedding into P. We prove that there exists a O(n(log n/log log n) 2)size universal point set for the class of simply-nested n-vertex planar graphs. This is a step towards a full answer for the well-known open problem on the size of the smallest universal point sets for planar graphs [1, 5, 9]. © 2012 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Angelini, P., Di Battista, G., Kaufmann, M., McHedlidze, T., Roselli, V., & Squarcella, C. (2012). Small point sets for simply-nested planar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7034 LNCS, pp. 75–85). https://doi.org/10.1007/978-3-642-25878-7_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
