- ホーム
- > 洋書
- > 英文書
- > Computer / General
Description
(Review)
(Table of content)
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.
(Review)
o 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)