Small Point Sets for Simply-Nested Planar Graphs


A point set P ⊆ R is universal for a class G if every graph of G has a planar straight-line embedding into P . We prove that there exists a O(n( logn log log n )) 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… (More)
DOI: 10.1007/978-3-642-25878-7_8

7 Figures and Tables


  • Presentations referencing similar topics