Algorithms on Trees and Graphs

by Gabriel Valiente
Springer-Verlag, 2002
ISBN 3-540-43550-6

Contents - Appendix A - BibTeX - Errata
Springer Online Catalogue
Bookshop price comparison using AddALL - BestBookBuys - FetchBook
Order at Amazon - Amazon UK - Barnes and Noble - WHSmith - Buch - Díaz de Santos - Powells

Full source code (for LEDA 4.4.1) and older source code (for LEDA research version) is available under the GNU General Public License version 2 or newer. Please read the installation instructions.

ACM Computing Reviews ... The book provides programmers with full implementation code and well-explained theory for isomorphism problems on trees and graphs.
Mathematical Reviews An interesting book, particularly useful for the treatment of tree algorithms, and for the explicit implementation of all the algorithms discussed. ... The book is a useful reference source for researchers and professionals, and is suitable as a supplementary text for graduate courses in the algorithmic area.
Zentralblatt für Mathematik ... The book goes beyond classical graph problems and addresses algorithmic problems with practical applications. 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.

Graph algorithms is a well-established subject in mathematics and computer science. Beyond classical application fields, like approximation, combinatorial optimization, graphics, and operations research, graph algorithms have recently attracted increased attention from computational molecular biology and computational chemistry.

Centered around the fundamental issue of graph isomorphism, this text goes beyond classical graph problems of shortest paths, spanning trees, flows in networks, and matchings in bipartite graphs. Advanced algorithmic results and techniques of practical relevance are presented in a coherent and consolidated way.

This book introduces graph algorithms on an intuitive basis followed by a detailed exposition in a literate programming style, with correctness proofs as well as worst-case analyses. Furthermore, full C++ implementations of all algorithms presented are given using the LEDA library of efficient data structures and algorithms. Numerous illustrations, examples, and exercises, and a comprehensive bibliography support students and professionals in using the book as a text and source of reference.

Gabriel Valiente