Description
ABOUT THE BOOK
Combinatorial techniques are of primary importance to computer scientists, mathematicians, and engineers. Graph Algorithms presents a comprehensive view of graph theory coupled with these combinatorial methods.
All of the recent progress concerning efficient algorithms for graph processing have been incorporated, yet the algorithmic aspects of Graph Algorithms have not been permitted to spoil the mathematical elegance of graph theory. Each chapter has a complete set of exercises, making the book useful both as a text and for self-study.
WHAT THE REVIEWERS HAVE SAID
"...the material that is covered is treated thoroughly and well."
-Computing Reviews
"...the book is highly recommended; it would serve well as a text for a computer science course and as a supplement to a graph theory course."
-IEEE Circuits and Systems Magazine
"It is a welcome addition as a self-contained exposition to graph algorithms and as a textbook containing results from a number of recent research papers."
-Mathematical Reviews
ISBN:0914894218