'[This book] provides an intensive study of the main topics of the field, with [a] list of problems following each topic and explains algorithms in a formal but simple language with a direct and intuitive presentation. Its usage is not limited to being a textbook for an upper-level undergraduate or a graduate course in mathematics. Thanks to the rich set of results covered it can also be used as a reference book for postgraduate students and researchers in the area of Graph algorithms … Besides being extremely useful to those who are interested in theory of graphs and design of graph algorithms, instructors can also benefit from the easy way it presents various ideas and approaches to problem solutions.' Vladimir Lacko, Zentralblatt MATH
'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, SIGACT News