Graphs, Networks and Algorithms

  • Dieter Jungnickel

Part of the Algorithms and Computation in Mathematics book series (AACIM, volume 5)

Table of contents

  1. Front Matter
    Pages I-XVI
  2. Pages 1-31
  3. Pages 59-93
  4. Pages 95-122
  5. Pages 123-146
  6. Pages 147-200
  7. Pages 253-269
  8. Pages 271-320
  9. Pages 341-365
  10. Pages 367-397
  11. Pages 399-432
  12. Pages 433-474
  13. Back Matter
    Pages 475-611

About this book


From the reviews of the first edition:

".... The book is a first class textbook and seems to be indispensable for everybody who has to teach combinatorial optimization. It is very helpful for students, teachers, and researchers in this area. The author finds a striking synthesis of nice and interesting mathematical results and practical applications. ... the author pays much attention to the inclusion of well-chosen exercises. The reader does not remain helpless; solutions or at least hints are given in the appendix. Except for some small basic mathematical and algorithmic knowledge the book is self-contained. ..."

Mathematical Reviews 2002

This thoroughly revised new edition offers a new chapter on the network simplex algorithm and a section on the five color theorem. Moreover, numerous smaller changes and corrections have been made and several recent developments have been discussed and referenced.


Matching Matchings algorithms combinatorial optimization complexity complexity theory graph theory graphs linear optimization network optimization optimzation

Authors and affiliations

  • Dieter Jungnickel
    • 1
  1. 1.Optimierung und Operations ResearchUniversität Augsburg Institut für Mathematik Lehrstuhl für Diskrete MathematikAugsburgGermany

Bibliographic information