02114cam a22003614a 4500 16957199 OSt 20150408114159.0 110912s2012 nyua b 001 0 eng 2011037984 9780521517188 (hardback) 9780521736534 (paperback) DLC DLC pcc QA166 .E93 2012 511.5 23 ESG COM051300 bisacsh Even, Shimon. 41338 Graph algorithms / Shimon Even; edited by Guy Even. 2nd ed. Cambridge, NY : Cambridge University Press, 2012. xii, 189 p. : ill. ; 24 cm. 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"-- Graph algorithms. 41339 COMPUTERS / Programming / Algorithms. bisacsh 36349 Guy Even. 41340 Cover image http://assets.cambridge.org/97805215/17188/cover/9780521517188.jpg 7 cbc orignew 1 ecip 20 y-gencatlg ddc BOOK 32828 267328 0 2014-01-05 0 0 511.5 ESG 2014-01-05 CL CL 2014-01-05 00:00:00 BOOK ddc 0