Algorithms on Trees and Graphs

Focusing on graph isomorphism, this book delves into advanced graph algorithms, extending beyond traditional areas like shortest paths and network flows. It presents algorithmic techniques relevant to fields such as computational molecular biology and chemistry. The content is structured intuitively, with detailed explanations in a literate programming style, including correctness proofs and worst-case analyses. Additionally, it features complete C++ implementations of all algorithms using the LEDA library, making it a practical resource for both theoretical and applied aspects of graph algorithms.