** Next:** 8.6 Problems
** Up:** 8. Undirected Graphs
** Previous:** 8.4.2 Optimal Solution for TSP using Branch and Bound

- 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.
- Ellis Horowitz, Sartaz Sahni, and Rajasekaran.
*Fundamentals of Computer
Algorithms*. W.H. Freeman and Company, 1998. Indian Edition published by
Galgotia Publications, 2000.
- 8.
- Eugene L Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B.Shmoys, editors.
*The Traveling Salesman Problem*. John Wiley & Sons, 1985.
- 9.
- Kurt Mehlhorn.
*Graph Algorithms and NP-Completeness*.
Volume 2 of *Data Structures and Algorithms*,
Springer-Verlag, 1984.
- 10.
- Robert Sedgewick.
*Algorithms*. Addison-Wesley,
Second Edition, 1988.
- 11.
- Jack Edmonds. Paths, trees, and flowers.
*Canadian Journal of Mathematics*, Volume 17, pp 449-467, 1965.
- 12.
- John E Hopcroft and Robert E. Tarjan.
Efficient algorithms for graph manipulation.
*Communications of the ACM*, Volume 16, Number 6 pp.372-378, 1973.
- 13.
- J.B. Kruskal. On the shortest spanning subtree of a graph and
the traveling salesman problem.
*Proceedings of the American Mathematical Society*,
Volume 7, pp 48-50, 1956.

- 14.
- R.C. Prim. Shortest connection networks and some generalizations.
*Bell System Technical Journal*, Volume 36, pp.1389-1401, 1957.

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

** Next:** 8.6 Problems
** Up:** 8. Undirected Graphs
** Previous:** 8.4.2 Optimal Solution for TSP using Branch and Bound
eEL,CSA_Dept,IISc,Bangalore