Parametric and Kinetic Minimum Spanning Trees

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

Active Bibliography

790 An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions – Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu - 1994
7 Dynamically Switching Vertices in Planar Graphs – Daniele Frigioni , Giuseppe F. Italiano - 2000
323 Indexing the Positions of Continuously Moving Objects – Simonas Saltenis, Christian S. Jensen, Scott T. Leutenegger, Mario A. Lopez - 2000
292 Finding the k Shortest Paths – David Eppstein - 1997
278 A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems – S T Barnard, H D Simon - 1993
123 Poly-logarithmic deterministic fully-dynamic graph algorithms I: connectivity and minimum spanning tree – Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup - 1997
34 An experimental analysis of self-adjusting computation – Umut A. Acar, Guy E. Blelloch, Matthias Blume, Robert Harper - 2006
6 Fully Dynamic Planarity Testing with Applications – Zvi Galil, et al.
Fully dynamic algorithms for bounded genus graphs – unknown authors - 1997