Graph Algorithms

Name: Graph Algorithms
Price: 102.11 USD
Availability: InStock
ISBN: 9780521517188

ISBN-10: 0521517184

ISBN-13: 9780521517188

Edition: 2nd 2011

Authors: Shimon Even, Guy Even

List price: $105.00

30 day, 100% satisfaction guarantee!

Marketplace

1 new & used from $102.11

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

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.

Book details

List price: $105.00
Edition: 2nd
Copyright year: 2011
Publisher: Cambridge University Press
Publication date: 9/19/2011
Binding: Hardcover
Pages: 202
Size: 6.22" wide x 9.25" long x 0.63" tall
Weight: 0.902
Language: English

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).




Paths in graphs



Trees



Depth-first search



Ordered trees



Flow in networks



Applications of network flow techniques



Planar graphs



Testing graph planarity