Fully Dynamic Minimum Spanning Trees
Author:
Italiano Giuseppe F.
Publisher
Springer New York
Reference15 articles.
1. Alberts D, Cattaneo G, Italiano GF (1997) An empirical study of dynamic graph algorithms. ACM J Exp Algorithm 2
2. Cattaneo G, Faruolo P, Ferraro Petrillo U, Italiano GF (2002) Maintaining dynamic minimum spanning trees: an experimental study. In: Proceeding 4th workshop on algorithm engineering and experiments (ALENEX 02), 6–8 Jan, pp 111–125
3. Eppstein D (1992) Finding the k smallest spanning trees. BIT 32:237–248
4. Eppstein D (1994) Tree-weighted neighbors and geometric k smallest spanning trees. Int J Comput Geom Appl 4:229–238
5. Eppstein D, Galil Z, Italiano GF, Nissenzweig A (1997) Sparsification – a technique for speeding up dynamic graph algorithms. J Assoc Comput Mach 44(5):669–696