Parametric and Kinetic Minimum Spanning Trees

by Pankaj Agarwal , David Eppstein , Leonidas J. Guibas , Monika R. Henzinger
Citations:29 - 7 self

Documents Related by Co-Citation

234 Data structures for mobile data – Julien Basch, Leonidas J. Guibas, John Hershberger - 1997
50 Proximity Problems on Moving Points – Julien Basch, Leonidas J. Guibas, Li Zhang - 1997
92 Kinetic Data Structures -- A State of the Art Report – Leonidas J. Guibas - 1998
29 Cylindrical Static and Kinetic Binary Space Partitions – Pankaj K. Agarwal, Leonidas J. Guibas, T. M. Murali, Jeffrey Scott Vitter - 1997
16 Geometric Lower Bounds for Parametric Matroid Optimization – David Eppstein - 1998
83 Ambivalent Data Structures For Dynamic 2-Edge-Connectivity And k Smallest Spanning Trees – Greg N. Frederickson - 1991
98 Improved Bounds for Planar k-Sets and Related Problems – T Dey - 1998
11 On Minimum and Maximum Spanning Trees of Linearly Moving Points,” Discrete – N Katoh, K Iwano, T Tokuyama - 1995
1770 Computational Geometry: An Introduction – Franco P Preparata, Michael Ian Shamos - 1985
50 On the number of halving lines – L Lovász - 1971
45 Point Sets With Many K-Sets – Géza Tóth - 1999
78 Deformable free space tilings for kinetic collision detection – Pankaj K. Agarwal, Julien Basch, Leonidas J. Guibas, John Hershberger, Li Zhang - 2000
974 Computational Geometry: Algorithms and Applications – M de Berg, M van Kreveld, M Overmars, O Schwarzkopf - 2000
694 Algorithms in Combinatorial Geometry – H Edelsbrunner - 1987
345 A distributed algorithm for minimum weight spanning trees – R G Gallager, P A Humblet, P M Spira - 1983
153 Data structures for on-line updating of minimum spanning trees, with applications – G N Frederickson
29 Kinetic Data Structures – Julien Basch - 1999
234 Applying parallel computation algorithms in the design of serial algorithms – Nimrod Megiddo - 1983
115 A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees – David R. Karger , Philip N. Klein, Robert E. Tarjan - 1994