1. Agarwal, P.K., Eppstein, D., Guibas, L.J., Henzinger, M.R.: Parametric and kinetic minimum spanning trees. In: Proc. 39th Symp. Foundations of Computer Science, pp. 596–605. IEEE, Los Alamitos (1998)
2. Ahuja, R., Magnanti, T., Orlin, J.: Network Flows. Prentice-Hall, Englewood Cliffs (1993)
3. Brown, M., Tarjan, R.: A fast merging algorithm. J. ACM 26(2), 211–226 (1979)
4. Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)
5. Katoh, N.: Parametric combinatorial optimization problems and applications. J. Inst. Electronics, Information and Communication Engineers 74, 949–956 (1991)