Graphs, Networks and Algorithms

More about the book

The previous editions have received high praise, with reviewers noting the book's status as an essential resource for teaching combinatorial optimization. It effectively serves students, teachers, and researchers, blending intriguing mathematical results with practical applications. The author emphasizes well-chosen exercises, providing solutions or hints in the appendix, making the text largely self-contained with only basic mathematical and algorithmic knowledge required. The latest edition showcases substantial development, featuring clear writing, excellent organization, and comprehensive coverage of essential theories and applications. Key algorithms are represented in Pascal-like notation, making it suitable for high-level undergraduate or low-level graduate courses in graph theory, combinatorial optimization, or computer science algorithms. The inclusion of well-worked exercise solutions enhances self-study opportunities for students. This thoroughly revised edition adds new material on NP-completeness, the Gallai-Edmonds structure theory for matchings, and additional exercises, all with solutions. The section on the 1-factor theorem has been rewritten to include a direct proof of the more general Berge-Tutte formula, and recent research developments are discussed with numerous updated references.