Zustellung: Fr, 17.10. - Mo, 20.10.
Versand in 2 Tagen
VersandkostenfreiWith updated material, additional exercises and new references, the new edition of this book retains the attributes praised by reviewers: its clear writing, good organisation, comprehensive coverage of essential theory and well-chosen applications.
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 beenadded.
Inhaltsverzeichnis
Prefaces. - Basic Graph Theory. - Algorithms and Complexity. - Shortest Paths. - Spanning Trees. - The Greedy Algorithm. - Flows. - Combinatorial Applications. - Connectivity and Depth First Search. - Colorings. - Circulations. - The Network Simplex Algorithm. - Synthesis of Networks. - Matchings. - Weighted Matchings. - A Hard Problem: The TSP. - Appendix A: Some NP-Complete Problems. - Appendix B: Solutions. - Appendix C: List of Symbols. - References. - Index.
Mehr aus dieser Reihe
Produktdetails
Erscheinungsdatum
14. Dezember 2014
Sprache
englisch
Auflage
Fourth Edition 2013
Seitenanzahl
696
Reihe
Mathematics and Statistics
Autor/Autorin
Dieter Jungnickel
Illustrationen
XX, 676 p.
Verlag/Hersteller
Produktart
kartoniert
Abbildungen
XX, 676 p.
Gewicht
1036 g
Größe (L/B/H)
235/155/38 mm
Sonstiges
Previously published in hardcover
ISBN
9783642436642
Entdecken Sie mehr
Pressestimmen
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)
Bewertungen
0 Bewertungen
Es wurden noch keine Bewertungen abgegeben. Schreiben Sie die erste Bewertung zu "Graphs, Networks and Algorithms" und helfen Sie damit anderen bei der Kaufentscheidung.