1. A. V. Aho, J. Hopcroft, and J. D. Ullman. The design and analysis of computer algorithms. Addison-Wesley, Reading, MA, 1974.
2. D. Eppstein, G. Italiano, R. Tamassia, R. E. Tarjan, J. Westbrook, and M. Yung. “Maintenance of a minimum spanning forest in a dynamic planar graph” Proc. of 1st SODA, 1990.
3. G. N. Frederickson. “Data structures for online updating of minimum spanning trees.” SIAM J. on Computing (14), 1985, 781–798.
4. G. N. Frederickson. “Ambivalent data structures for dynamic 2-edge connectivity and k smallest spanning trees.” Proc. of 32nd FOCS, 1991.
5. Z. Galil and G. Italiano. “Fully dynamic algorithms for edge connectivity problems.” Proc. of 23rd STOC, 1991.