Graph Algorithms 2nd Edition by Shimon Even (PDF)

Description

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.

User’s Reviews

Editorial Reviews: Review “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 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 Book Description This thoroughly revised second edition of Shimon Even’s Graph Algorithms explains algorithms directly and intuitively, in formal but simple language. About the Author Shimon Even (1935–2004) was a pioneering researcher on graph algorithms and cryptography. He was a highly influential educator who played a major role in establishing computer science education in Israel at the Weizmann Institute and the Technion. He served as a source of professional inspiration and as a role model for generations of students and researchers. He is the author of Algorithmic Combinatorics (1973) and Graph Algorithms (1979). Read more

Reviews from Amazon users which were colected at the time this book was published on the website:

⭐a strongly and bautifull book, with precise explantions and clear schemas and algorithms.

⭐This book should be called “Graph mathemathics”.It is tough reading, no usuable pieces of code, just dry theory.Not recomended.

⭐

Keywords

Free Download Graph Algorithms 2nd Edition in PDF format
Graph Algorithms 2nd Edition PDF Free Download
Download Graph Algorithms 2nd Edition 2011 PDF Free
Graph Algorithms 2nd Edition 2011 PDF Free Download
Download Graph Algorithms 2nd Edition PDF
Free Download Ebook Graph Algorithms 2nd Edition