Graph algorithms / Shimon Even; edited by Guy Even.
By: Even, Shimon.
Contributor(s): Guy Even.
Cambridge, NY : Cambridge University Press, 2012Edition: 2nd ed.Description: xii, 189 p. : ill. ; 24 cm.ISBN: 9780521736534 (paperback).Subject(s): Graph algorithms | COMPUTERS / Programming / AlgorithmsGenre/Form: Print books.| Current location | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|
| On Shelf | QA166 .E93 2012 (Browse shelf) | Available | AU0000000009276 |
Browsing Alfaisal University Shelves , Shelving location: On Shelf Close shelf browser
|
|
|
|
|
|
|
||
| QA164 .W35 2011 Introduction to combinatorics / | QA165 .B66 2012 Combinatorics of permutations / | QA166 .C4525 2015 Graphs & digraphs / | QA166 .E93 2012 Graph algorithms / | QA166 .H364 2015 Handbook of graph theory, combinatorial optimization, and algorithms / | QA166.245 .B76 2013 Discrete structures and their interactions / | QA166.25 .L56 2009 Design theory |
Includes bibliographical references and index.
Machine generated contents note: 1. Paths in graphs; 2. Trees; 3. Depth-first search; 4. Ordered trees; 5. Flow in networks; 6. Applications of network flow techniques; 7. Planar graphs; 8. Testing graph planarity.
"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"--