EbookBell.com

Most ebook files are in PDF format, so you can easily read them using various software such as Foxit Reader or directly on the Google Chrome browser.
Some ebook files are released by publishers in other formats such as .awz, .mobi, .epub, .fb2, etc. You may need to install specific software to read these formats on mobile/PC, such as Calibre.

Please read the tutorial at this link: https://ebookbell.com/faq

We offer FREE conversion to the popular formats you request; however, this may take some time. Therefore, right after payment, please email us, and we will try to provide the service as quickly as possible.

For some exceptional file formats or broken links (if any), please refrain from opening any disputes. Instead, email us first, and we will try to assist within a maximum of 6 hours.

EbookBell Team

Graph Algorithms 2nd Edition Shimon Even Guy Even

Name: Graph Algorithms 2nd Edition Shimon Even Guy Even
SKU: BELL-2614324
Price: 31.00 USD
Availability: InStock
Rating: 4 (66 reviews)

SKU: BELL-2614324

$ 31.00 ~~$ 45.00~~ (-31%)

4.0

66 reviews

Graph Algorithms 2nd Edition Shimon Even Guy Even instant download after payment.

Publisher: Cambridge University Press

File Extension: PDF

File size: 1.32 MB

Pages: 202

Author: Shimon Even, Guy Even

ISBN: 9780521517188, 0521517184

Language: English

Year: 2011

Edition: 2

Product desciption

Graph Algorithms 2nd Edition Shimon Even Guy Even by Shimon Even, Guy Even 9780521517188, 0521517184 instant download after payment.

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.