Fully Dynamic Connectivity: Upper and Lower Bounds
Author:
Italiano Giuseppe F.
Publisher
Springer New York
Reference18 articles.
1. Alberts D, Cattaneo G, Italiano GF (1997) Anempirical study of dynamic graph algorithms. ACM J Exp Algorithms 2
2. Beame P, Fich FE (2002) Optimal bounds for the predecessor problem and related problems. J Comput Syst Sci 65(1):38–72
3. Eppstein D (1997) Dynamic connectivity in digital images. Inf Process Lett 62(3):121–126
4. 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
5. Eppstein D, Italiano GF, Tamassia R, Tarjan RE, Westbrook J, Yung M (1992) Maintenance of a minimum spanning forest in a dynamic plane graph. J Algorithms 13:33–54