Algorithms on Trees and Graphs
Autor Gabriel Valienteen Limba Engleză Hardback – 5 sep 2002
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (2) | 383.31 lei 43-57 zile | |
| Springer International Publishing – 13 oct 2022 | 383.31 lei 43-57 zile | |
| Springer Berlin, Heidelberg – 30 noi 2010 | 418.34 lei 38-44 zile | |
| Hardback (2) | 449.02 lei 43-57 zile | |
| Springer Berlin, Heidelberg – 5 sep 2002 | 449.02 lei 43-57 zile | |
| Springer International Publishing – 12 oct 2021 | 583.05 lei 43-57 zile |
Preț: 449.02 lei
Preț vechi: 561.28 lei
-20% Nou
Puncte Express: 674
Preț estimativ în valută:
85.94€ • 89.57$ • 71.54£
85.94€ • 89.57$ • 71.54£
Carte tipărită la comandă
Livrare economică 06-20 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540435501
ISBN-10: 3540435506
Pagini: 508
Ilustrații: XV, 489 p.
Dimensiuni: 155 x 235 x 33 mm
Greutate: 0.86 kg
Ediția:2002
Editura: Springer Berlin, Heidelberg
Colecția Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540435506
Pagini: 508
Ilustrații: XV, 489 p.
Dimensiuni: 155 x 235 x 33 mm
Greutate: 0.86 kg
Ediția:2002
Editura: Springer Berlin, Heidelberg
Colecția Springer
Locul publicării:Berlin, Heidelberg, Germany
V-ar putea interesa
-
Cybersecurity and Applied MathematicsLeigh Metcalf-28%Preț: 306.14 lei422.45 lei -
-23%Preț: 468.86 lei608.91 lei -
Preț: 408.05 lei -
Algebra for CryptologistsAlko R. MeijerPreț: 781.16 lei -
-20%Preț: 335.42 lei419.28 lei -
-18%Preț: 1350.15 lei1646.53 lei -
-18%Preț: 920.17 lei1122.16 lei -
Soft Methods for Data ScienceMaria Brigida Ferraro-20%Preț: 1247.25 lei1559.06 lei -
-20%Preț: 328.55 lei410.68 lei -
-20%Preț: 331.24 lei414.06 lei -
-20%Preț: 315.40 lei394.24 lei -
-20%Preț: 322.78 lei403.47 lei -
-20%Preț: 329.66 lei412.07 lei -
-20%Preț: 400.71 lei500.89 lei -
-15%Preț: 619.34 lei728.64 lei -
Programmieren mit Maple VJ.S. Devitt-20%Preț: 414.35 lei517.93 lei -
Fuzzy-Begriffe: Formale Begriffsanalyse unscharfer DatenSilke Pollandt-20%Preț: 343.83 lei429.80 lei -
-20%Preț: 705.17 lei881.46 lei -
-20%Preț: 321.65 lei402.06 lei -
-20%Preț: 326.62 lei408.28 lei -
-20%Preț: 351.60 lei439.50 lei
Public țintă
GraduateCuprins
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.
Recenzii
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 für 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)
"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 für 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)
Textul de pe ultima copertă
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
Caracteristici
Algorithms are first presented on an intuitive basis, followed by a detailed exposition in a literate programming style Correctness proofs are given, together with a worst-case analysis of the algorithms Full C++ implementation of all the algorithms using the LEDA library Interactive demonstration including animations An extensive chapter is devoted to the algorithmic techniques used in the book
Notă biografică
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.
Descriere
Descriere de la o altă ediție sau format:
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