Data Structures and Algorithms in Java[1].pdf - Fulvio Frisone

[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.
[30] G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis, GraphDrawing.
Upper Saddle River, NJ: Prentice Hall, 1999.
[31] E. W. Dijkstra, A note on two problems in connexion with graphs,
Numerische Mathematik, vol. 1, pp. 269–271, 1959.
[32] J. R. Driscoll, H. N. Gabow, R. Shrairaman, and R. E. Tarjan, Relaxed
heaps: An alternative to Fibonacci heaps with applications to parallel
computation., Commun. ACM, vol. 31, pp. 1343–1354, 1988.
[33] S. Even, Graph Algorithms. Potomac, Maryland: Computer Science Press,
1979.
[34] D. Flanagan, Java in a Nutshell. OReilly, 4th ed., 2002.
[35] R. W. Floyd, Algorithm 97: Shortest path, Communications of the ACM,
vol. 5, no. 6, p. 345, 1962.
[36] R. W. Floyd, Algorithm 245: Treesort 3, Communications of the ACM,
vol. 7, no. 12, p. 701, 1964.
[37] M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in
improved network optimization algorithms, J. ACM, vol. 34, pp. 596–615, 1987.
[38] E. Gamma, R. Helm, R. Johnson, and J. Vlissides, Design Patterns:
Elements of Reusable Object-Oriented Software. Reading, Mass.: Addison-
Wesley, 1995.
[39] A. M. Gibbons, Algorithmic Graph Theory. Cambridge, UK: Cambridge
University Press, 1985.
[40] A. Goldberg and D. Robson, Smalltalk-80: The Language. Reading,
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.
[42] G. H. Gonnet and J. I. Munro, Heaps on heaps, SIAM Journal on
Computing, vol. 15, no. 4, pp. 964–971, 1986.
[43] M. T. Goodrich, M. Handy, B. Hudson, and R. Tamassia, Accessing the
internal organization of data structures in the JDSL library, in Proc. Workshop on
Algo-rithm Engineering and Experimentation (M. T. Goodrich and C. C.
McGeoch, eds.), vol. 1619 of Lecture Notes Comput. Sci., pp. 124–139, Springer-
Verlag, 1999.
[44] M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter, Externalmemory
computational geometry, in Proc. 34th Annu. IEEE Sympos. Found.
Comput. Sci., pp. 714–723, 1993.
[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.
921