---

1. Introduction.- 2. Algorithmic Techniques.- 3. Tree Traversal.- 4. Tree Isomorphism.- 5. Graph Traversal.- 6. Clique, Independent Set, and Vertex Cover.- 7. Graph Isomorphism.- IV. Appendices.- A. An Overview of LEDA.- A.1 Introduction.- A.2 Data Structures.- A.3 Fundamental Graph Algorithms.- A.4 A Simple Representation of Trees.- A.5 A Simple Implementation of Radix Sort.- Bibliographic Notes.- B. Interactive Demonstration of Graph Algorithms.- C. Program Modules.

---

From the reviews:

"The main theme of this (research) monograph on graph algorithms is the isomorphism problem (for trees and graphs). Algorithms are both described on an intuitive basis and presented (and discussed) in detail using Knuth´s literate programming style (C++, using the LEDA library). Besides offering an introduction to an interesting and important subject (with applications, e.g., in biology and chemistry), it also is a valuable (and unified) reference to material previously only available in research papers." (P. Schmitt, Monatshefte für Mathematik, Vol. 142 (4), 2004)

"The book goes beyond classical graph problems and addresses algorithmic problems with practical applications. ... will have a great potential in the hands of a dedicated teacher who is both willing and capable of using the software. Because much of the material in the book was previously only available in specialized research literature, this book will be very valuable also for researchers of algorithmic graph theory. This richly illustrated book has an extensive bibliography and several appendices describing the software." (Matti Vuorinen, Zentralblatt MATH, Vol. 1007, 2003)

---