Graphs, Networks and Algorithms

Nonfiction, Science & Nature, Mathematics, Combinatorics, Applied
Cover of the book Graphs, Networks and Algorithms by Dieter Jungnickel, Springer Berlin Heidelberg
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Dieter Jungnickel ISBN: 9783642322785
Publisher: Springer Berlin Heidelberg Publication: November 8, 2012
Imprint: Springer Language: English
Author: Dieter Jungnickel
ISBN: 9783642322785
Publisher: Springer Berlin Heidelberg
Publication: November 8, 2012
Imprint: Springer
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Springer Berlin Heidelberg

Cover of the book Anästhesie und Intensivmedizin für die Fachpflege by Dieter Jungnickel
Cover of the book Plant-Based Remediation Processes by Dieter Jungnickel
Cover of the book Cerebral Localization by Dieter Jungnickel
Cover of the book Progress and Perspective in the Treatment of Lung Cancer by Dieter Jungnickel
Cover of the book Ecology and Evolution of the Freshwater Mussels Unionoida by Dieter Jungnickel
Cover of the book Objective Medical Decision-Making Systems Approach in Disease by Dieter Jungnickel
Cover of the book Chemical Design of Responsive Microgels by Dieter Jungnickel
Cover of the book Studies on the Anatomy and Function of Bone and Joints by Dieter Jungnickel
Cover of the book Engineering Heat Transfer by Dieter Jungnickel
Cover of the book Global Product Development by Dieter Jungnickel
Cover of the book Photonic Structures Inspired by Nature by Dieter Jungnickel
Cover of the book Aspects of Culture in Second Language Acquisition and Foreign Language Learning by Dieter Jungnickel
Cover of the book Earth System Modelling - Volume 2 by Dieter Jungnickel
Cover of the book Innovations in European Rural Landscapes by Dieter Jungnickel
Cover of the book Soil Enzymology by Dieter Jungnickel
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy