Graph algorithms
Shimon Even · 1979 · 249 pages
As an Amazon Associate we earn from qualifying purchases. Some book links are affiliate links; you pay the same price and we may earn a small commission.
About this book
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.
Appears in these reading paths
Algorithms and data structures: a reading path to real problem-solving fluency
Learn graph theory: the best books in order
Related reading guides
Reader reviews
Ratings and notes from readers — tagged with how deep into the subject they were.
Loading reviews…