7.6 To Probe Further

1.

Alfred V Aho, John E. Hopcroft, and Jeffrey D Ullman. Data Structures and Algorithms. Addison-Wesley, 1983.

2.

Gilles Brassard and Paul Bratley. Fundamentals of Algorithmics. Prentice-Hall, 1996. Indian Edition published by Prentice Hall of India, 1998.

3.

Thomas H. Cormen, Charles E. Leiserson, and Donald L. Rivest. Introduction to Algorithms. The MIT Electrical Engineering and Computer Science Series, 1990. Indian Edition published in 1999.

4.

Mark Allen Weiss. Data Structures and Algorithm Analysis in C++. Benjamin-Cummings, 1994. Indian Edition published in 1998.

5.

Alfred V Aho, John E. Hopcroft, and Jeffrey D Ullman. The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.

6.

Sara Baase and Allen Van Gelder. Computer Algorithms: Introduction to Design and Analysis. Addison-Wesley, Third Edition, 2000. Indian Edition published by Pearson Education Asia, 2000.

7.

Richard Bellman. Dynamic Programming. Princeton University Press, 1957.

8.

Gilles Brassard and Paul Bratley. Algorithmics : Theory and Practice. Prentice-Hall, 1988.

9.

Ellis Horowitz, Sartaz Sahni, and Rajasekaran. Fundamentals of Computer Algorithms. W.H. Freeman and Company, 1998. Indian Edition published by Galgotia Publications, 2000.

10.

Kurt Mehlhorn. Graph Algorithms and NP-Completeness. Volume 2 of Data Structures and Algorithms, Springer-Verlag, 1984.

11.

Robert Sedgewick. Algorithms. Addison-Wesley, Second Edition, 1988.

12.

Nicklaus Wirth. Data Structures + Algorithms = Programs. Prentice-Hall, Englewood Cliffs. 1975.

13.

Richard Bellman. On a routing problem. Quarterly of Applied Mathematics. Volume 16, Number 1, pp. 87-90, 1958.

14.

E.W. Dijkstra. A note on two problems in connection with graphs. Numerische Mathematik, Volume 1, pp 269-271, 1959.

15.

Jack Edmonds. Paths, trees, and flowers. Canadian Journal of Mathematics, Volume 17, pp 449-467, 1965.

16.

Robert W Floyd. Algorithm 97 (Shortest Path). Communications of the ACM, Volume 5, Number 6, pp. 345, 1962.

17.

John E Hopcroft and Robert E. Tarjan. Efficient algorithms for graph manipulation. Communications of the ACM, Volume 16, Number 6 pp.372-378, 1973.

18.

Robert E. Tarjan. Depth first search and linear graph algorithms. SIAM Journal on Computing, Volume 1, Number 2, pp.146-160, 1972.

19.

Stephen Warshall. A theorem on boolean matrices. Journal of the ACM, Volume 9, Number 1, pp.11-12, 1962.