Graph Algorithms

This thoroughly revised second edition of Shimon Even's Graph Algorithms explains algorithms directly and intuitively, in formal but simple language.

Shimon Even (Author), Guy Even (Edited by)

9780521517188, Cambridge University Press

Hardback, published 19 September 2011

202 pages, 64 b/w illus. 10 tables
23.5 x 15.8 x 1.6 cm, 0.41 kg

'The book is an excellent introduction to (algorithmic) graph theory, and seems to be a good choice for a class on the topic, or for self-study. Each chapter comes with its own selected bibliography, and ends with a collection of problems to help the reader check his or her understanding of the material presented in that chapter. Proofs are always provided and are also the topic of a few selected exercises.' Anthony Labarre, SIGACT News

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.

Subject Areas: Algorithms & data structures [UMB], Optimization [PBU]