The history the minimum spanning tree problem

[28] S. A. Demurjian, Sr., Software design, in The Computer Science and Engineering Handbook (A. B. Tucker, Jr., ed.), ch. 108, pp. 2323–2351, CRC Press, 1997.

[29] G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis, Algorithms for drawing graphs: an annotated bibliography, Comput. Geom. Theory Appl., vol. 4, pp. 235–282, 1994.

[34] D. Flanagan, Java in a Nutshell. OReilly, 4th ed., 2002.

R. W. Floyd, Algorithm 97: Shortest path, Communications of the ACM, [35]
vol. 5, no. 6, p. 345, 1962.

A. Goldberg and D. Robson, Smalltalk-80: The Language. Reading, [40]
Mass.: Addison-Wesley, 1989.

[41] G. H. Gonnet and R. Baeza-Yates, Handbook of Algorithms and Data Structures in Pascal and C. Reading, Mass.: Addison-Wesley, 1991.

[45] R. L. Graham and P. Hell, On the history of the minimum spanning tree problem, Annals of the History of Computing, vol. 7, no. 1, pp. 43–57, 1985.

[46] L. J. Guibas and R. Sedgewick, A dichromatic framework for balanced trees, in Proc. 19th Annu. IEEE Sympos. Found. Comput. Sci., Lecture Notes Comput. Sci., pp. 8–21, Springer-Verlag, 1978.

[50] J. E. Hopcroft and R. E. Tarjan, Efficient algorithms for graph
manipulation, Communications of the ACM, vol. 16, no. 6, pp. 372–378, 1973. [51] C. S. Horstmann, Computing Concepts in Java. New York: John Wiley, and Sons, 1998.

B. Huang and M. Langston, Practical in-place merging, Communications [52]
of the ACM, vol. 31, no. 3, pp. 348–352, 1988.

R. M. Karp and V. Ramachandran, Parallel algorithms for shared memory [57]
machines, in Handbook of Theoretical Computer Science (J. van Leeuwen, ed.), pp. 869–941, Amsterdam: Elsevier/The MIT Press, 1990.

[58] P. Kirschenhofer and H. Prodinger, The path length of random skip lists, Acta Informatica, vol. 31, pp. 775–792, 1994.

[63] D. E. Knuth, Sorting and Searching,vol.3of The Art of Computer Programming. Reading, MA: Addison-Wesley, 2nd ed., 1998.

[64] D. E. Knuth, J. H. Morris, Jr., and V. R. Pratt, Fast pattern matching in strings, SIAM Journal on Computing, vol. 6, no. 1, pp. 323–350, 1977.

922