"Like the original, the second edition has an unmistakable style and presentation that makes the material both clear and deep. By restricting the treatment to graph algorithms--and not to algorithms in general--the book, in around 200 pages, expounds deeply on the subject in ways normally reserved for literature reviews. On the other hand, the presentation is so clear that, as a side benefit, readers are instructed by example how to think about and present complex material. Thus, even for an audience only tangentially interested in graph algorithms, this remains required reading."
William Fahle, Computing Reviews

"The book is an excellent introduction to (algorithmic) graph theory, and seems to be a good choice for a class on the topic, or for self-study. Each chapter comes with its own selected bibliography, and ends with a collection of problems to help the reader check his or her understanding of the material presented in that chapter. Proofs are always provided and are also the topic of a few selected exercises."
Anthony Labarre, Laboratoire d’informatique Gaspard-Monge for SIGACT News