Algorithms on Trees and Graphs

Gabriel Valiente

ISBN 10: 3030818845 / ISBN 13: 9783030818845

Editore: Springer Nature Switzerland AG, CH, 2021

Riguardo questo articolo

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.

Codice articolo LU-9783030818845

Dati bibliografici

• Titolo: Algorithms on Trees and Graphs
• Editore: Springer Nature Switzerland AG, CH
• Data di pubblicazione: 2021
• Lingua: Inglese
• ISBN 10: 3030818845
• ISBN 13: 9783030818845
• Rilegatura: Hardback
• Edizione: Second Edition 2021.
• Condizione: New
• Dimensioni: 16,51 L x 2,54 A x 24,77 P centimetri 16,51 centimetri di larghezza per 2,54 centimetri di altezza per 24,77 centimetri di profondità

Descrizione articolo

Riassunto

Graph algorithms is a well-established subject in mathematics and computer science. Beyond classical application fields, such as 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.

Informazioni sull?autore

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.