Graph Algorithms [2nd ed.] [Perpetual access]
By: Even, Shimon.
Contributor(s): Even, Guy [ed.].
Publisher: Cambridge Cambridge University Press 2012Edition: 2nd ed.Description: xii, 189p.ISBN: 9781139015165.Subject(s): Graph theory | Graph algorithmsDDC classification: 511.5 | Ev23g2 Online resources: Click here to access online Summary: 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.| Item type | Current location | Collection | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
E books
|
PK Kelkar Library, IIT Kanpur | Electronic Resources | 511.5 Ev23g2 (Browse shelf) | Available | EBK10752 |
Total holds: 0
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.
There are no comments for this item.