Name
Abstract | ||
|---|---|---|
A point set P⊆ℝ2 is universal for a class $\cal G$ if every graph of ${\cal G}$ has a planar straight-line embedding into P. We prove that there exists a $O(n (\frac{\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]. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-25878-7_8 | Graph Drawing |
Keywords | Field | DocType |
well-known open problem,planar straight-line,cal g,smallest universal point set,simply-nested planar graph,planar graph,full answer,small point set,simply-nested n-vertex planar graph,log n,size universal point | Binary logarithm,Graph,Discrete mathematics,Combinatorics,Embedding,Open problem,Existential quantification,Planar,Point set,Planar graph,Mathematics | Conference |
Volume | ISSN | Citations |
7034 | 0302-9743 | 4 |
PageRank | References | Authors |
0.44 | 10 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Patrizio Angelini | 1 | 117 | 9.37 |
| Giuseppe Di Battista | 2 | 2298 | 361.48 |
| Michael Kaufmann | 3 | 361 | 25.45 |
| Tamara Mchedlidze | 4 | 136 | 25.56 |
| Vincenzo Roselli | 5 | 69 | 11.57 |
| Claudio Squarcella | 6 | 76 | 8.76 |