Algorithms on Trees and Graphs by Gabriel Valiente.

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...

Full description

Saved in:
Bibliographic Details
Main Author: Valiente, Gabriel (Author)
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
Edition:1st ed. 2002.
Series:Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Table of Contents:
  • 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.