Parametric and Kinetic Minimum Spanning Trees

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

Active Bibliography

6 Dynamically Switching Vertices in Planar Graphs – Daniele Frigioni , Giuseppe F. Italiano - 2000
6 Fully Dynamic Planarity Testing with Applications – Zvi Galil, et al.
35 An experimental analysis of self-adjusting computation – Umut A. Acar, Guy E. Blelloch, Matthias Blume, Robert Harper - 2006
23 On Levels in Arrangements of Curves – Timothy M. Chan - 2002
20 Kinetic data structures – Leonidas Guibas - 2004
55 Dynamic Graph Algorithms – David Eppstein, Zvi Galil, Giuseppe F. Italiano - 1999
7 Using Sparsification for Parametric Minimum Spanning Tree Problems – David Fernández-baca, Giora Slutzki, David Eppstein - 1996
1 R.F.: Experimental analysis of algorithms for updating minimum spanning trees on graphs subject to changes on edge weights – Celso C. Ribeiro, Rodrigo F. Toso - 2007
3 Top-Trees and Dynamic Graph Algorithms – Jacob Holm, Kristian de Lichtenberg - 1998
4 Improved Data Structures for Fully Dynamic Biconnectivity – Monika Rauch Henzinger - 1997
Optimization in dynamic environments – Nicolas Boria, Vangelis Th. Paschos - 2011
125 Poly-logarithmic deterministic fully-dynamic graph algorithms I: connectivity and minimum spanning tree – Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup - 1997
11. Implementations and Experimental Studies of Dynamic Graph Algorithms – Christos D. Zaroliagis
Optimization in dynamic environments Nicolas Boria, Vangelis Th. PaschosOptimization in dynamic environments ∗ – Nicolas Boria, Vangelis Th. Paschos - 2011
16 Kinetic Connectivity of Rectangles – John Hershberger, Subhash Suri - 1999
50 Proximity Problems on Moving Points – Julien Basch, Leonidas J. Guibas, Li Zhang - 1997
27 Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators – Adam L. Buchsbaum , Haim Kaplan, Anne Rogers, Jeffery R. Westbrook - 1998
Dynamic 2-Connectivity With Backtracking – Johannes La Poutre, Jeffery Westbrook, Siam J. Comput C - 1998
3 On the Complexity of Time-Dependent Shortest Paths – Luca Foschini, John Hershberger, Subhash Suri