Author:
Giammarresi Dora,Italiano Giuseppe F.
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974.
2. G. Di Battista and R. Tamassia. On-line graph algorithms with SPQR-trees. In Proc. 17th ICALP, 598–611, 1990.
3. D. Eppstein, Z. Galil, G. F. Italiano, and A. Nissenzweig. Sparsification — A technique for speeding up dynamic graph algorithms. Manuscript, 1992.
4. D. Eppstein, G. F. Italiano, R. Tamassia, R. E. Tarjan, J. Westbrook, and M. Yung. Maintenance of a minimum spanning forest in a dynamic plane graph. J. Algorithms, 13:33–54, 1992.
5. S. Even and Y. Shiloach. An on-line edge deletion problem. J. Assoc. Comput. Mach., 28:1–4, 1981.