Dekorationsartikel gehören nicht zum Leistungsumfang.
Algorithms on Trees and Graphs
Buch von Gabriel Valiente
Sprache: Englisch

71,68 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Aktuell nicht verfügbar

Kategorien:
Beschreibung
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 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. Numerous illustrations, examples, and exercises, and a comprehensive bibliography support students and professionals in using the book as a text and source of reference
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 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. Numerous illustrations, examples, and exercises, and a comprehensive bibliography support students and professionals in using the book as a text and source of reference
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.- IV. Appendices.- A. An Overview of LEDA.- A.1 Introduction.- A.2 Data Structures.- A.3 Fundamental Graph Algorithms.- A.4 A Simple Representation of Trees.- A.5 A Simple Implementation of Radix Sort.- Bibliographic Notes.- B. Interactive Demonstration of Graph Algorithms.- C. Program Modules.
Details
Erscheinungsjahr: 2002
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Buch
Seiten: 508
ISBN-13: 9783540435501
ISBN-10: 3540435506
Sprache: Englisch
Ausstattung / Beilage: HC runder Rücken kaschiert
Einband: Gebunden
Autor: Valiente, Gabriel
Auflage: 2002
Hersteller: Springer-Verlag GmbH
Springer Berlin Heidelberg
Maße: 241 x 160 x 32 mm
Von/Mit: Gabriel Valiente
Erscheinungsdatum: 05.09.2002
Gewicht: 0,922 kg
preigu-id: 103516309
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.- IV. Appendices.- A. An Overview of LEDA.- A.1 Introduction.- A.2 Data Structures.- A.3 Fundamental Graph Algorithms.- A.4 A Simple Representation of Trees.- A.5 A Simple Implementation of Radix Sort.- Bibliographic Notes.- B. Interactive Demonstration of Graph Algorithms.- C. Program Modules.
Details
Erscheinungsjahr: 2002
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Buch
Seiten: 508
ISBN-13: 9783540435501
ISBN-10: 3540435506
Sprache: Englisch
Ausstattung / Beilage: HC runder Rücken kaschiert
Einband: Gebunden
Autor: Valiente, Gabriel
Auflage: 2002
Hersteller: Springer-Verlag GmbH
Springer Berlin Heidelberg
Maße: 241 x 160 x 32 mm
Von/Mit: Gabriel Valiente
Erscheinungsdatum: 05.09.2002
Gewicht: 0,922 kg
preigu-id: 103516309
Warnhinweis

Ähnliche Produkte

Ähnliche Produkte