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. Full C++ implementations of all algorithms presented are given using the LEDA library of efficient data structures and algorithms.
| Author: Gabriel Valiente |
| Publisher: Springer |
| Publication Date: Sep 05, 2002 |
| Number of Pages: 489 pages |
| Binding: Hardback or Cased Book |
| ISBN-10: 3540435506 |
| ISBN-13: 9783540435501 |
Related Products
LAP Lambert Academic Publishing
An Efficient Algorithm for Shortest Path Tree in Dynamic Graph
$44.21
Vieweg+teubner Verlag
The Steiner Tree Problem: A Tour Through Graphs, Algorithms, and Complexity
$56.30
