Graph algorithms
2nd ed.
We couldn't estimate the reading time for this book.
Author
Publication
2011 - Cambridge University Press, Cambridge, NY, New York (State)
Language
English
Word Count
0 words, Guess
Page Count
0 pages
Identifiers
- Internet Archivegraphalgorithms00even_675
- Internet Archivegraphalgorithms00even_738
- ISBN-139780521517188
- ISBN-139780521736534
- ISBN-100521517184
and 5 more
- ISBN-100521736536
- Library of Congress Control Number2011037984
- Better World Books9780521736534
- Better World Books9780521517188
- Open LibraryOL25026223M
Classifications
- DDC511/.5
- LCCQA166 .E93 2011
- LCCQA166 .E93 2012
and 1 more
- LCCQA166.245
Description
"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"--
Subjects
Links
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!