000 | 01345 a2200229 4500 | ||
---|---|---|---|
003 | OSt | ||
020 | _a9781139015165 | ||
040 | _cIIT Kanpur | ||
041 | _aeng | ||
082 |
_a511.5 _bEv23g2 |
||
100 | _aEven, Shimon | ||
245 |
_aGraph Algorithms [2nd ed.] [Perpetual access] _cShimon Even; edited by Guy Even |
||
250 | _a2nd ed. | ||
260 |
_bCambridge University Press _c2012 _aCambridge |
||
300 | _axii, 189p | ||
520 | _aShimon 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. | ||
650 | _aGraph theory | ||
650 | _aGraph algorithms | ||
700 | _aEven, Guy [ed.] | ||
856 | _uhttps://www.cambridge.org/core/books/graph-algorithms/8B295BD0845A174FFE6B2CD6D4B2C63F | ||
942 | _cEBK | ||
999 |
_c565300 _d565300 |