Spanning Trees and Spanners
Author:
- David EppsteinDEDavid Eppstein
- 1 January 2000
- book chapter
- Published by Elsevier
- p. 425-461
Abstract
No abstract availableThis publication has 60 references indexed in Scilit:
- Triangulations intersect nicelyDiscrete & Computational Geometry, 1996
- Tree SpannersSIAM Journal on Discrete Mathematics, 1995
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fieldsJournal of the ACM, 1995
- LONG NON-CROSSING CONFIGURATIONS IN THE PLANEFundamenta Informaticae, 1995
- Edge insertion for optimal triangulationsDiscrete & Computational Geometry, 1993
- On sparse spanners of weighted graphsDiscrete & Computational Geometry, 1993
- Farthest neighbors, maximum spanning trees and related problems in higher dimensionsComputational Geometry, 1992
- Euclidean minimum spanning trees and bichromatic closest pairsDiscrete & Computational Geometry, 1991
- A linear-time algorithm for computing the voronoi diagram of a convex polygonDiscrete & Computational Geometry, 1989
- Decomposable searching problems I. Static-to-dynamic transformationJournal of Algorithms, 1980