Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics)
From the reviews of the fourth edition:“This fourth edition of a long-respected resource will become an indispensable reference for any researcher, teacher, or student who deals with problems of combinatorial optimization. The book qualifies as a first-class textbook, built on university courses, workshops, seminars, discussions, and presentations, and enriched with a large set of well-designed examples. … the author has provided solutions and hints, which make the text easier to use for self-study.” (Alexander Tzanov, Computing Reviews, September, 2013)“This book is a first course or class on graphs, networks and algorithms, and is indispensable for everybody who has to teach combinatorial optimization. The well-worked solutions to the exercises, or hints for some, are indispensable for the students, or readers, does not remain helpless. It is very helpful and suitable for graduate courses in combinatorics, as well as for independent study and research by students, teachers, professionals and researcher in this area. In short, the excellent book of Jungnickel, ought to available for reference.” (Francisco José Cano Sevilla, The European Mathematical Society, April, 2013)“This is certainly an accessible, serious, and time tested textbook at the graduate level on graph algorithms. I would also wholeheartedly recommend this book for professionals who work in this area as a reference book because of its thorough and encyclopedic nature. … this book gives a good presentation of some of the typical problems in the area, an insightful exposition of the related theoretical issues, as well as the associated classic algorithmic solutions with sufficient analysis.” (Zhizhang Shen, Zentralblatt MATH, Vol. 1255, 2013)“Graphs, Networks, and Algorithms is a comprehensive and up-to-date textbook and reference on graph-theoretical methods in combinatorial optimization, together with fundamentals of graph theory. … A key strength of this book is the extensive references and commentary on extensions, generalizations, and further results … . The book is written at a level suitable for advanced mathematics or computer science undergraduates … . I give it a very strong recommendation as an advanced and up-to-date text and reference on combinatorial optimization and applied graph theory.” (Francis Fung, The Mathematical Association of America, January, 2012)