| Record ID | marc_loc_updates/v39.i37.records.utf8:11030337:1846 |
| Source | Library of Congress |
| Download Link | /show-records/marc_loc_updates/v39.i37.records.utf8:11030337:1846?format=raw |
LEADER: 01846nam a22003138a 4500
001 2011037984
003 DLC
005 20110912161633.0
008 110912s2011 nyu b 001 0 eng
010 $a 2011037984
020 $a9780521517188 (hardback)
020 $a9780521736534 (paperback)
040 $aDLC$cDLC
042 $apcc
050 00 $aQA166$b.E93 2011
082 00 $a511/.5$223
084 $aCOM051300$2bisacsh
100 1 $aEven, Shimon.
245 10 $aGraph algorithms /$cShimon Even.
250 $a2nd ed.
260 $aCambridge, NY :$bCambridge University Press,$c2011.
263 $a1112
300 $ap. cm.
520 $a"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"--$cProvided by publisher.
504 $aIncludes bibliographical references and index.
505 8 $aMachine 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.
650 0 $aGraph algorithms.
650 7 $aCOMPUTERS / Programming / Algorithms.$2bisacsh
856 42 $3Cover image$uhttp://assets.cambridge.org/97805215/17188/cover/9780521517188.jpg