0
Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Combinatorics & graph theory

Buy Now

Graphs, Networks and Algorithms (Hardcover, 4th ed. 2013) Loot Price: R3,108
Discovery Miles 31 080
Graphs, Networks and Algorithms (Hardcover, 4th ed. 2013): Dieter Jungnickel

Graphs, Networks and Algorithms (Hardcover, 4th ed. 2013)

Dieter Jungnickel

Series: Algorithms and Computation in Mathematics, 5

 (sign in to rate)
Loot Price R3,108 Discovery Miles 31 080 | Repayment Terms: R291 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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

General

Imprint: Springer-Verlag
Country of origin: Germany
Series: Algorithms and Computation in Mathematics, 5
Release date: November 2012
First published: 2013
Authors: Dieter Jungnickel
Dimensions: 235 x 155 x 42mm (L x W x T)
Format: Hardcover
Pages: 676
Edition: 4th ed. 2013
ISBN-13: 978-3-642-32277-8
Categories: Books > Science & Mathematics > Mathematics > Combinatorics & graph theory
Books > Computing & IT > General theory of computing > Mathematical theory of computation
Books > Science & Mathematics > Mathematics > Optimization > General
LSN: 3-642-32277-8
Barcode: 9783642322778

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners