1. |
|
|
2. |
|
|
3. |
|
|
4. |
|
|
5. |
|
|
6. |
- Angelini, P., et al.
(författare)
-
On the area requirements of Euclidean minimum spanning trees
- 2011
-
Ingår i: Algorithms and Data Structures. - Berlin, Heidelberg : Springer Berlin/Heidelberg. - 9783642222993 ; , s. 25-36
-
Konferensbidrag (refereegranskat)abstract
- In their seminal paper on Euclidean minimum spanning trees [Discrete & Computational Geometry, 1992], Monma and Suri proved that any tree of maximum degree 5 admits a planar embedding as a Euclidean minimum spanning tree. Their algorithm constructs embeddings with exponential area; however, the authors conjectured that c(n) x c(n) area is sometimes required to embed an n-vertex tree of maximum degree 5 as a Euclidean minimum spanning tree, for some constant c > 1. In this paper, we prove the first exponential lower bound on the area requirements for embedding trees as Euclidean minimum spanning trees.
|
|
7. |
|
|
8. |
|
|
9. |
|
|
10. |
|
|