Check nearby libraries
Buy this book
![Loading indicator](/images/ajax-loader-bar.gif)
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.
Check nearby libraries
Buy this book
![Loading indicator](/images/ajax-loader-bar.gif)
Previews available in: English
Showing 8 featured editions. View all 8 editions?
Edition | Availability |
---|---|
1
Graphs, Networks and Algorithms
2014, Springer Berlin / Heidelberg
in English
3642436641 9783642436642
|
zzzz
Libraries near you:
WorldCat
|
2
Graphs, Networks and Algorithms
2013, Springer Berlin Heidelberg, Imprint: Springer
electronic resource /
in English
- 4th ed. 2013.
3642322786 9783642322785
|
aaaa
Libraries near you:
WorldCat
|
3 |
zzzz
Libraries near you:
WorldCat
|
4
Graphs, Networks and Algorithms
Nov 09, 2012, Springer, Brand: Springer
hardcover
3642322778 9783642322778
|
zzzz
Libraries near you:
WorldCat
|
5 |
zzzz
Libraries near you:
WorldCat
|
6 |
zzzz
Libraries near you:
WorldCat
|
7 |
zzzz
Libraries near you:
WorldCat
|
8 |
zzzz
Libraries near you:
WorldCat
|
Book Details
Table of Contents
Edition Notes
Classifications
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?History
- Created June 30, 2019
- 6 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
1 day ago | Edited by MARC Bot | import existing book |
December 25, 2021 | Edited by ImportBot | import existing book |
August 24, 2020 | Edited by ImportBot | import existing book |
June 30, 2019 | Edited by MARC Bot | import existing book |
June 30, 2019 | Created by MARC Bot | Imported from Internet Archive item record |