Willkommen, schön sind Sie da!
Logo Ex Libris

Algorithms on Trees and Graphs

  • Fester Einband
  • 490 Seiten
Graph algorithms is a well-established subject in mathematics and computer science. Beyond classical application fields, like appr... Weiterlesen
20%
67.00 CHF 53.60
Auslieferung erfolgt in der Regel innert 2 bis 3 Wochen.

Beschreibung

Klappentext
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

Inhalt
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.

Produktinformationen

Titel: Algorithms on Trees and Graphs
Autor:
EAN: 9783540435501
ISBN: 978-3-540-43550-1
Format: Fester Einband
Herausgeber: Springer
Genre: Informatik
Anzahl Seiten: 490
Gewicht: 861g
Größe: H243mm x B165mm x T32mm
Jahr: 2002
Auflage: 2002

Bewertungen

Gesamtübersicht

Meine Bewertung

Bewerten Sie diesen Artikel


Zuletzt angesehen
Verlauf löschen