Algorithms on Trees and Graphs

AvGabriel Valiente

Inbunden, Engelska, 2002

972 kr

Beställningsvara. Skickas inom 5-8 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

Inbunden

806 kr

Skickas

Häftad

694 kr

Skickas inom 10-15 vardagar

Beskrivning

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

Produktinformation

Utgivningsdatum:2002-09-05
Mått:155 x 235 x undefined mm
Vikt:922 g
Format:Inbunden
Språk:Engelska
Antal sidor:489
Upplaga:2002
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540435501

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT

Recensioner i media

From the reviews: "The main theme of this (research) monograph on graph algorithms is the isomorphism problem (for trees and graphs). Algorithms are both described on an intuitive basis and presented (and discussed) in detail using Knuth's literate programming style (C++, using the LEDA library). Besides offering an introduction to an interesting and important subject (with applications, e.g., in biology and chemistry), it also is a valuable (and unified) reference to material previously only available in research papers." (P. Schmitt, Monatshefte fur Mathematik, Vol. 142 (4), 2004) "The book goes beyond classical graph problems and addresses algorithmic problems with practical applications. ... will have a great potential in the hands of a dedicated teacher who is both willing and capable of using the software. Because much of the material in the book was previously only available in specialized research literature, this book will be very valuable also for researchers of algorithmic graph theory. This richly illustrated book has an extensive bibliography and several appendices describing the software." (Matti Vuorinen, Zentralblatt MATH, Vol. 1007, 2003)

Innehållsförteckning

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.