Graph algorithms
Material type:![Text](/opac-tmpl/lib/famfamfam/BK.png)
- 9780521736534
- 511.5 23 EVE-G
- QA166 .E93 2012
- COM051300
Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|
![]() |
IIITD Reference | Mathematics | REF 511.5 EVE-G (Browse shelf(Opens below)) | Available | 004398 |
Browsing IIITD shelves, Shelving location: Reference, Collection: Mathematics Close shelf browser (Hides shelf browser)
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
REF 511.5 CHA-I Introduction to graph theory | REF 511.5 CHU-S Spectral graph theory | REF 511.5 DEO-G Graph theory : with applications to engineering and computer science | REF 511.5 EVE-G Graph algorithms | REF 511.5 FRI-I Introduction to random graphs | REF 511.5 GOD-A Algebraic graph theory | REF 511.5 GRO-G Graph theory and its applications |
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"--
There are no comments on this title.