Graph Algorithms / Shimon Even ; edited by Guy Even.
Material type: TextPublisher: Cambridge : Cambridge University Press, 2011Edition: 2nd edDescription: 1 online resource (202 pages) : digital, PDF file(s)Content type:- text
- computer
- online resource
- 9781139015165 (ebook)
- 511/.5 23
- QA166 .E93 2012
Item type | Current library | Call number | Copy number | Status | Date due | Barcode |
---|---|---|---|---|---|---|
Books | Library, Institute of Information and Communication Technology General Stacks | 511.5 EVG (Browse shelf(Opens below)) | 1 | Available | I000250 | |
Books | Library, Institute of Information and Communication Technology General Stacks | 511.5 EVG (Browse shelf(Opens below)) | 2 | Available | I000251 | |
Books | Library, Institute of Information and Communication Technology Audio Visual | 511.5 EVG (Browse shelf(Opens below)) | 3 | Available | I000252 |
Browsing Central Library, SUST shelves, Shelving location: General Stacks Close shelf browser (Hides shelf browser)
511.5 DIG Graph theory / | 511.5 DIG Graph theory / | 511.5 EVG Graph algorithms / | 511.5 EVG Graph Algorithms / | 511.5 EVG Graph Algorithms / | 511.5 GRA Graph theory and its applications / | 511.5 GRA Graphs, combinatorics, clgorithms and cpplications / |
Title from publisher's bibliographic system (viewed on 04 Apr 2016).
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 on this title.