Get Free Shipping on orders over $79
Graph Algorithms - Shimon Even
eTextbook alternate format product

Instant online reading.
Don't wait for delivery!

Go digital and save!

Graph Algorithms

By: Shimon Even, Guy Even (Editor)

Hardcover | 19 September 2011 | Edition Number 2

At a Glance

Hardcover


RRP $167.95

$149.75

11%OFF

or 4 interest-free payments of $37.44 with

 or 

Ships in 5 to 7 business days

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.
Industry Reviews
'[This book] provides an intensive study of the main topics of the field, with [a] list of problems following each topic and explains algorithms in a formal but simple language with a direct and intuitive presentation. Its usage is not limited to being a textbook for an upper-level undergraduate or a graduate course in mathematics. Thanks to the rich set of results covered it can also be used as a reference book for postgraduate students and researchers in the area of Graph algorithms ... Besides being extremely useful to those who are interested in theory of graphs and design of graph algorithms, instructors can also benefit from the easy way it presents various ideas and approaches to problem solutions.' Vladimir Lacko, Zentralblatt MATH
'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

More in Algorithms & Data Structures

Addiction by Design : Machine Gambling in Las Vegas - Natasha Dow Schull
Python for Algorithmic Trading : From Idea to Cloud Deployment - Yves Hilpisch
Learning Spark : Lightning-Fast Data Analytics - Brooke Wenig

RRP $152.00

$73.75

51%
OFF
Applied Data Science in FinTech : Models, Tools, and Case Studies - Juraj Hric
Uncertain Data Analysis : Fuzzy Vector Algorithms - Sansanee Auephanwiriyakul
Uncertain Data Analysis : Fuzzy Vector Algorithms - Sansanee Auephanwiriyakul

RRP $94.99

$85.75

10%
OFF
Python 3 Using DeepSeek - Oswald Campesato

$348.75