×

Algorithms on trees and graphs. With Python code. 2nd edition. (English) Zbl 1471.05001

Texts in Computer Science. Cham: Springer (ISBN 978-3-030-81884-5/hbk; 978-3-030-81885-2/ebook). xv, 387 p. (2021).
Publisher’s description: This textbook introduces graph algorithms on an intuitive basis followed by a detailed exposition using structured pseudocode, with correctness proofs as well as worst-case analyses. 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 biology, bioinformatics, and computational chemistry. Centered around the fundamental issue of graph isomorphism, this book 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. Furthermore, Python code for all algorithms presented is given in a appendix. Numerous illustrations, examples, problems, exercises, and a comprehensive bibliography support students and professionals in using the book as a text and source of reference.
See the review of the first edition in [Zbl 1007.05001].

MSC:

05-01 Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics
05-04 Software, source code, etc. for problems pertaining to combinatorics
05C85 Graph algorithms (graph-theoretic aspects)
68-01 Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68R10 Graph theory (including graph drawing) in computer science
68W40 Analysis of algorithms

Citations:

Zbl 1007.05001

Software:

Python
PDFBibTeX XMLCite
Full Text: DOI