Overview
- Algorithms are first presented on an intuitive basis, followed by a detailed exposition using structured pseudocode
- Correctness proofs are given, together with a worst-case analysis of the algorithms
- An extensive chapter is devoted to the algorithmic techniques used in the book
Part of the book series: Texts in Computer Science (TCS)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (7 chapters)
-
Front Matter
-
Introduction
-
Front Matter
-
-
Algorithms on Trees
-
Front Matter
-
-
Algorithms on Graphs
-
Front Matter
-
-
Back Matter
Keywords
About this book
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.
Authors and Affiliations
About the author
Bibliographic Information
Book Title: Algorithms on Trees and Graphs
Book Subtitle: With Python Code
Authors: Gabriel Valiente
Series Title: Texts in Computer Science
DOI: https://doi.org/10.1007/978-3-030-81885-2
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2021
Hardcover ISBN: 978-3-030-81884-5Published: 12 October 2021
Softcover ISBN: 978-3-030-81887-6Published: 13 October 2022
eBook ISBN: 978-3-030-81885-2Published: 11 October 2021
Series ISSN: 1868-0941
Series E-ISSN: 1868-095X
Edition Number: 2
Number of Pages: XV, 387
Number of Illustrations: 145 b/w illustrations
Topics: Discrete Mathematics in Computer Science, Algorithms, Graph Theory, Python, Programming Languages, Compilers, Interpreters