Looking for an examination copy?
If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact firstname.lastname@example.org providing details of the course you are teaching.
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.Read more
- Classic text with revisions by the author offers an attractive choice of topics with simple yet precise explanations
- Foreword by Richard M. Karp
Reviews & endorsements
"If you use graph algorithms, you should get a copy."
Paul Cull, Computing ReviewsSee more 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 algorithms--and not to algorithms in general--the book, in around 200 pages, expounds deeply on the subject in ways normally reserved for literature reviews. On the other hand, the presentation is so clear that, as a side benefit, readers are instructed by example how to think about and present complex material. Thus, even for an audience only tangentially interested in graph algorithms, this remains required reading."
William Fahle, Computing Reviews
"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, Laboratoire d’informatique Gaspard-Monge for SIGACT News
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Edition: 2nd Edition
- Date Published: September 2011
- format: Paperback
- isbn: 9780521736534
- length: 202 pages
- dimensions: 229 x 152 x 11 mm
- weight: 0.28kg
- contains: 64 b/w illus. 10 tables
- availability: Available
Table of Contents
1. Paths in graphs
3. Depth-first search
4. Ordered trees
5. Flow in networks
6. Applications of network flow techniques
7. Planar graphs
8. Testing graph planarity.
Instructors have used or reviewed this title for the following courses
- Advanced knowledge based systems
- Algorithms and Complexity
- Computer Science Senior Research
- Data Structures and Algorithm Analysis
- Graph and combinatorial algorithms
- Intro to game programming
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email email@example.comRegister Sign in
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×