Algorithms on Trees and Graphs: With Python Code

Graph algorithms is a well-established subject in mathematics and computer science, with recent attention from computational molecular biology and computational chemistry. This book introduces graph algorithms on an intuitive basis, followed by a detailed exposition in a literate programming style, with correctness proofs and worst-case analyses.

Format: Hardback
Length: 387 pages
Publication date: 12 October 2021
Publisher: Springer Nature Switzerland AG

Graph algorithms, a well-established field within mathematics and computer science, has witnessed a remarkable surge in interest beyond its traditional applications in approximation, combinatorial optimization, graphics, and operations research. In recent years, graph algorithms have garnered significant attention from computational molecular biology and computational chemistry, expanding their horizons to diverse domains. At the core of graph algorithms lies the fundamental concept of graph isomorphism, which extends beyond classical graph problems such as shortest paths, spanning trees, network flows, and matchings in bipartite graphs. This comprehensive text delves into advanced algorithmic results and techniques with practical relevance, presenting them in a coherent and consolidated manner.

Beginning with an intuitive introduction, the book progresses to a detailed exposition in a literate programming style, accompanied by correctness proofs and comprehensive worst-case analyses. Furthermore, the book offers full C++ implementations of all algorithms presented, utilizing the LEDA library of efficient data structures and algorithms. By providing a comprehensive and accessible approach, this text serves as an invaluable resource for both researchers and practitioners seeking to leverage the power of graph algorithms in their respective fields.

Weight: 770g
Dimension: 235 x 155 (mm)
ISBN-13: 9783030818845
Edition number: 2nd ed. 2021