Algorithms on Trees and Graphs /
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 biolog...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Format: | eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2002.
|
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
Table of Contents:
- Preface
- Part I. Introduction: 1. Introduction. 2. Algorithmic Techniques
- Part II. Algorithms on Trees: 3. Tree Traversal. 4. Tree Isomorphism
- Part III. Algorithms on Graphs: 5. Graph Traversal. 6. Clique, Independent Set, and Vertex Cover. 7. Graph Isomorphism; Appendices: A. An Overview of Leda. B. Interactive Demonstration of Graph Algorithms. C. Program Modules. - References
- Index.