|
|
|
|
| LEADER |
02763nmm a2200349 u 4500 |
| 001 |
EB000686900 |
| 003 |
EBX01000000000000000539982 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783662049211
|
| 100 |
1 |
|
|a Valiente, Gabriel
|
| 245 |
0 |
0 |
|a Algorithms on Trees and Graphs
|h Elektronische Ressource
|c by Gabriel Valiente
|
| 250 |
|
|
|a 1st ed. 2002
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2002, 2002
|
| 300 |
|
|
|a XV, 489 p
|b online resource
|
| 505 |
0 |
|
|a 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
|
| 653 |
|
|
|a Artificial intelligence / Data processing
|
| 653 |
|
|
|a Bioinformatics
|
| 653 |
|
|
|a Programming Techniques
|
| 653 |
|
|
|a Computer science / Mathematics
|
| 653 |
|
|
|a Computer programming
|
| 653 |
|
|
|a Discrete Mathematics in Computer Science
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Discrete mathematics
|
| 653 |
|
|
|a Data Science
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 028 |
5 |
0 |
|a 10.1007/978-3-662-04921-1
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-662-04921-1?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 005.11
|
| 520 |
|
|
|a 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
|