Algorithms on Trees and Graphs
With Python Code
2nd Edition
Published on 11. October 2021
XV, 387 pages
978-3-030-81885-2 (ISBN)
Description
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. Full C++ implementations of all algorithms presented are given using the LEDA library of efficient data structures and algorithms.
More details
Series
Edition
Second Edition 2021
Language
English
Place of publication
Cham
Switzerland
Publishing group
Springer International Publishing
Product notice
Reflowable
Illustrations
XV, 387 p. 145 illus.
File size
5,44 MB
ISBN-13
978-3-030-81885-2 (9783030818852)
DOI
10.1007/978-3-030-81885-2
Schweitzer Classification
Other editions
Additional editions
Book
10/2021
2nd Edition
Springer
€96.29
Shipment within 7-9 days
Person
Gabriel Valiente, PhD, is an accredited Full Professor at the Department of Computer Science and a member of the Algorithms, Bioinformatics, Complexity and Formal Methods Research Group of the Technical University of Catalonia in Barcelona, Spain. He has been lecturing on Data Structures and Algorithms at the undergraduate level and Advanced Graph Algorithms at the graduate level over the last several years. His current research is centered on combinatorial algorithms on graphs and, in particular, algorithms for comparing trees and graphs, with emphasis on algorithms in computational biology and bioinformatics.
Content
1. Introduction.- 2. Algorithmic Techniques.- 3. Tree Traversal.- 4. Tree Isomorphism.- 5. Graph Traversal.- 6. Clique, Independent Set, and Vertex Cover.- 7. Graph Isomorphism.
