Graph Algorithms [Paperback]

This thoroughly revised second edition of Shimon Even's Graph Algorithms explains algorithms directly and intuitively, in formal but simple language.Shimon Even's Graph Algorithms, published in 1979, was a seminal introductory textbook. This thoroughly revised second edition, with a foreword by Richard M. Karp and notes by Andrew V. Goldberg, continues the exceptional presentation from the first edition, explaining algorithms in formal but simple language with a direct and intuitive presentation.Shimon Even's Graph Algorithms, published in 1979, was a seminal introductory textbook. This thoroughly revised second edition, with a foreword by Richard M. Karp and notes by Andrew V. Goldberg, continues the exceptional presentation from the first edition, explaining algorithms in formal but simple language with a direct and intuitive presentation.Shimon Even's Graph Algorithms, published in 1979, was a seminal introductory book on algorithms read by everyone engaged in the field. This thoroughly revised second edition, with a foreword by Richard M. Karp and notes by Andrew V. Goldberg, continues the exceptional presentation from the first edition and explains algorithms in a formal but simple language with a direct and intuitive presentation. The book begins by covering basic material, including graphs and shortest paths, trees, depth-first-search, and breadth-first search. The main part of the book is devoted to network flows and applications of network flows, and it ends with chapters on planar graphs and testing graph planarity.1. Paths in graphs; 2. Trees; 3. Depth-first search; 4. Ordered trees; 5. Flow in networks; 6. Applications of network flow techniques; 7. Planar graphs; 8. Testing graph planarity. If you use graph algorithms, you should get a copy.
Paul Cull, Computing Reviews Like the original, the second edition has an unmistakable style and presentation that makes the material both clear and deep. By restricting the treatment to graph algorilÈ