List Price: $95.00
Publisher: Cambridge University Press
Binding: Trade Cloth
Size: 6.25" wide x 9.25" long x 0.50" tall
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.
Shimon Even (1935ndash;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).
|Paths in graphs|
|Flow in networks|
|Applications of network flow techniques|
|Testing graph planarity|
100% Money Back Guarantee: Wrong item? No problem! Our hassle-free
returns policy has you covered.
We'll also process your order within 1-2 business days. Learn more about our