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-XIX
  2. Pages 1-32
  3. Pages 59-95
  4. Pages 97-125
  5. Pages 127-151
  6. Pages 153-208
  7. Pages 261-278
  8. Pages 279-341
  9. Pages 363-386
  10. Pages 387-417
  11. Pages 419-456
  12. Pages 457-500
  13. Back Matter
    Pages 501-650

About this book


From the reviews of the previous editions

".... 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. ..."

K.Engel, Mathematical Reviews 2002

The substantial development effort of this text, involving multiple editions and trailing in the context of various workshops, university courses and seminar series, clearly shows through in this new edition with its clear writing, good organisation, comprehensive coverage of essential theory, and well-chosen applications. The proofs of important results and the representation of key algorithms in a Pascal-like notation allow this book to be used in a high-level undergraduate or low-level graduate course on graph theory, combinatorial optimization or computer science algorithms. The well-worked solutions to exercises are a real bonus for self study by students. The book is highly recommended.

P .B. Gibbons, Zentralblatt für Mathematik 1061, 2005

The third edition of this standard textbook contains additional material: two new application sections (on graphical codes and their decoding) and about two dozen further exercises (with solutions, as throughout the text). Moreover, recent developments have been discussed and referenced, in particular for the travelling salesman problem. The presentation has been improved in many places (for instance, in the chapters on shortest paths and on colorings), and a number of proofs have been reorganized, making them more precise or more transparent.


Graph Graph theory Matching Sim algorithms combinatorial optimization complexity computer computer science optimization

Authors and affiliations

  • Dieter Jungnickel
    • 1
  1. 1.Universität AugsburgAugsburgGermany

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2008
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Mathematics and Statistics
  • Print ISBN 978-3-540-72779-8
  • Online ISBN 978-3-540-72780-4
  • Series Print ISSN 1431-1550
  • Buy this book on publisher's site