Zum Hauptinhalt springen
Dekorationsartikel gehören nicht zum Leistungsumfang.
Algorithms on Trees and Graphs
With Python Code
Taschenbuch von Gabriel Valiente
Sprache: Englisch

64,19 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Aktuell nicht verfügbar

Kategorien:
Beschreibung
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. 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.
Über 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.
Zusammenfassung
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.
Inhaltsverzeichnis
1. Introduction.- 2. Algorithmic Techniques.- 3. Tree Traversal.- 4. Tree Isomorphism.- 5. Graph Traversal.- 6. Clique, Independent Set, and Vertex Cover.- 7. Graph Isomorphism.
Details
Erscheinungsjahr: 2022
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Reihe: Texts in Computer Science
Inhalt: xv
387 S.
145 s/w Illustr.
387 p. 145 illus.
ISBN-13: 9783030818876
ISBN-10: 303081887X
Sprache: Englisch
Ausstattung / Beilage: Paperback
Einband: Kartoniert / Broschiert
Autor: Valiente, Gabriel
Auflage: 2nd ed. 2021
Hersteller: Springer International Publishing
Springer International Publishing AG
Texts in Computer Science
Maße: 235 x 155 x 22 mm
Von/Mit: Gabriel Valiente
Erscheinungsdatum: 13.10.2022
Gewicht: 0,61 kg
Artikel-ID: 124773983
Über 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.
Zusammenfassung
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.
Inhaltsverzeichnis
1. Introduction.- 2. Algorithmic Techniques.- 3. Tree Traversal.- 4. Tree Isomorphism.- 5. Graph Traversal.- 6. Clique, Independent Set, and Vertex Cover.- 7. Graph Isomorphism.
Details
Erscheinungsjahr: 2022
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Reihe: Texts in Computer Science
Inhalt: xv
387 S.
145 s/w Illustr.
387 p. 145 illus.
ISBN-13: 9783030818876
ISBN-10: 303081887X
Sprache: Englisch
Ausstattung / Beilage: Paperback
Einband: Kartoniert / Broschiert
Autor: Valiente, Gabriel
Auflage: 2nd ed. 2021
Hersteller: Springer International Publishing
Springer International Publishing AG
Texts in Computer Science
Maße: 235 x 155 x 22 mm
Von/Mit: Gabriel Valiente
Erscheinungsdatum: 13.10.2022
Gewicht: 0,61 kg
Artikel-ID: 124773983
Warnhinweis

Ähnliche Produkte

Ähnliche Produkte