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 2005

Once again, the new edition has been thoroughly revised. In particular, some further material has been added: more on NP-completeness (especially on dominating sets), a section on the Gallai-Edmonds structure theory for matchings, and about a dozen additional exercises – as always, with solutions. Moreover, the section on the 1-factor theorem has been completely rewritten: it now presents a short direct proof for the more general Berge-Tutte formula. Several recent research developments are discussed and quite a few references have been added.

*"synopsis" may belong to another edition of this title.*

Dieter Jungnickel is an internationally known mathematician working in the field of applied algebra, coding theory, design theory, finite geometry, codes and designs and combinatorial optimization.

He has published several well-known books, including “Optimization Methods”, “Finite Fields”, “Coding Theory” and “Graphs, Networks and Algorithms”, some of which have been published both in English and German.

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)

*"About this title" may belong to another edition of this title.*

US$ 86.29

**Shipping:**
US$ 2.64

Within U.S.A.

ISBN 10: 3642322778
ISBN 13: 9783642322778

New
Quantity Available: 5

Seller:

Rating

**Book Description **Condition: New. Seller Inventory # 19097258-n

Published by
Springer 2012-11-09
(2012)

ISBN 10: 3642322778
ISBN 13: 9783642322778

New
Quantity Available: 6

Seller:

Rating

**Book Description **Springer 2012-11-09, 2012. Condition: New. Brand new book, sourced directly from publisher. Dispatch time is 4-5 working days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely. Seller Inventory # NU-LBR-01131143

Published by
Springer
(2012)

ISBN 10: 3642322778
ISBN 13: 9783642322778

New
Hardcover
Quantity Available: 1

Seller:

Rating

**Book Description **Springer, 2012. Hardcover. Condition: New. Seller Inventory # DADAX3642322778

Published by
Springer Berlin Heidelberg 2012-11-09, Heidelberg
(2012)

ISBN 10: 3642322778
ISBN 13: 9783642322778

New
Hardcover
Quantity Available: > 20

Seller:

Rating

**Book Description **Springer Berlin Heidelberg 2012-11-09, Heidelberg, 2012. hardback. Condition: New. Seller Inventory # 9783642322778

Published by
Springer
(2017)

ISBN 10: 3642322778
ISBN 13: 9783642322778

New
Paperback
Quantity Available: 10

Seller:

Rating

**Book Description **Springer, 2017. Paperback. Condition: New. PRINT ON DEMAND Book; New; Publication Year 2017; Not Signed; Fast Shipping from the UK. No. book. Seller Inventory # ria9783642322778_lsuk

Published by
Springer 2012-11-09
(2012)

ISBN 10: 3642322778
ISBN 13: 9783642322778

New
Quantity Available: 20

Seller:

Rating

**Book Description **Springer 2012-11-09, 2012. Condition: New. Brand new book, sourced directly from publisher. Dispatch time is 4-5 working days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely. Seller Inventory # NU-ING-27410737

Published by
Springer-Verlag Gmbh Nov 2012
(2012)

ISBN 10: 3642322778
ISBN 13: 9783642322778

New
Buch
Quantity Available: 2

Seller:

Rating

**Book Description **Springer-Verlag Gmbh Nov 2012, 2012. Buch. Condition: Neu. Neuware - 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 2005 Once again, the new edition has been thoroughly revised. In particular, some further material has been added: more on NP-completeness (especially on dominating sets), a section on the Gallai-Edmonds structure theory for matchings, and about a dozen additional exercises - as always, with solutions. Moreover, the section on the 1-factor theorem has been completely rewritten: it now presents a short direct proof for the more general Berge-Tutte formula. Several recent research developments are discussed and quite a few references have been added. 675 pp. Englisch. Seller Inventory # 9783642322778

Published by
Springer-Verlag Gmbh Nov 2012
(2012)

ISBN 10: 3642322778
ISBN 13: 9783642322778

New
Quantity Available: 2

Seller:

Rating

**Book Description **Springer-Verlag Gmbh Nov 2012, 2012. Buch. Condition: Neu. Neuware - 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 2005 Once again, the new edition has been thoroughly revised. In particular, some further material has been added: more on NP-completeness (especially on dominating sets), a section on the Gallai-Edmonds structure theory for matchings, and about a dozen additional exercises - as always, with solutions. Moreover, the section on the 1-factor theorem has been completely rewritten: it now presents a short direct proof for the more general Berge-Tutte formula. Several recent research developments are discussed and quite a few references have been added. 675 pp. Englisch. Seller Inventory # 9783642322778

Published by
Springer-Verlag Gmbh Nov 2012
(2012)

ISBN 10: 3642322778
ISBN 13: 9783642322778

New
Quantity Available: 2

Seller:

Rating

**Book Description **Springer-Verlag Gmbh Nov 2012, 2012. Buch. Condition: Neu. Neuware - 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 2005 Once again, the new edition has been thoroughly revised. In particular, some further material has been added: more on NP-completeness (especially on dominating sets), a section on the Gallai-Edmonds structure theory for matchings, and about a dozen additional exercises - as always, with solutions. Moreover, the section on the 1-factor theorem has been completely rewritten: it now presents a short direct proof for the more general Berge-Tutte formula. Several recent research developments are discussed and quite a few references have been added. 675 pp. Englisch. Seller Inventory # 9783642322778

Published by
Springer

ISBN 10: 3642322778
ISBN 13: 9783642322778

New
Hardcover
Quantity Available: > 20

Seller:

Rating

**Book Description **Springer. Hardcover. Condition: New. 3642322778 Special order direct from the distributor. Seller Inventory # ING9783642322778