SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "WFRF:(Angelini F.) srt2:(2010-2014)"

Search: WFRF:(Angelini F.) > (2010-2014)

  • Result 1-5 of 5
Sort/group result
   
EnumerationReferenceCoverFind
1.
  •  
2.
  •  
3.
  • Angelini, P., et al. (author)
  • On the area requirements of Euclidean minimum spanning trees
  • 2014
  • In: Computational geometry. - : Elsevier. - 0925-7721 .- 1879-081X. ; 47:2, s. 200-213
  • Journal article (peer-reviewed)abstract
    • In their seminal paper on Euclidean minimum spanning trees, Monma and Suri (1992) 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 there exist n-vertex trees of maximum degree 5 that require c(n) x c(n) area to be embedded as Euclidean minimum spanning trees, 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.
  •  
4.
  • Angelini, P., et al. (author)
  • On the area requirements of Euclidean minimum spanning trees
  • 2011
  • In: Algorithms and Data Structures. - Berlin, Heidelberg : Springer Berlin/Heidelberg. - 9783642222993 ; , s. 25-36
  • Conference paper (peer-reviewed)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.
  •  
5.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-5 of 5

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view