Algorithms on Trees and Graphs (Paperback)

Gabriel Valiente

ISBN 10: 303081887X / ISBN 13: 9783030818876

Verlag: Springer Nature Switzerland AG, Cham, 2022

Beschreibung

Paperback. 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Bestandsnummer des Verkäufers 9783030818876

Bibliografische Details

• Titel: Algorithms on Trees and Graphs (Paperback)
• Verlag: Springer Nature Switzerland AG, Cham
• Erscheinungsjahr: 2022
• Sprache: Englisch
• ISBN-10: 303081887X
• ISBN-13: 9783030818876
• Einband: Paperback
• Auflage: 2. Auflage
• Zustand: new

Über diesen Titel

Inhaltsangabe

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.

Über die Autorin bzw. den Autor

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.