Table Of ContentAlgorithms and Computation
in Mathematics • Volume 5
Editors
ManuelBronstein ArjehM.Cohen
HenriCohen DavidEisenbud
BerndSturmfels
Forfurthervolumes:
http://www.springer.com/series/3339
This page intentionally left blank
Dieter Jungnickel
Graphs, Networks
and Algorithms
Fourth Edition
DieterJungnickel
Institutfu¨rMathematik
Universita¨tAugsburg
Augsburg
Germany
ISSN1431-1550 AlgorithmsandComputationinMathematics
ISBN978-3-642-32277-8 ISBN978-3-642-32278-5(eBook)
DOI10.1007/978-3-642-32278-5
SpringerHeidelbergNewYorkDordrechtLondon
LibraryofCongressControlNumber:2012951158
MathematicsSubjectClassification: 11-01,11Y40,11E12,11R29
©Springer-VerlagBerlinHeidelberg1998,2004,2008,2013
Thisworkissubjecttocopyright.AllrightsarereservedbythePublisher,whetherthewholeorpartof
thematerialisconcerned,specificallytherightsoftranslation,reprinting,reuseofillustrations,recitation,
broadcasting,reproductiononmicrofilmsorinanyotherphysicalway,andtransmissionorinformation
storageandretrieval,electronicadaptation,computersoftware,orbysimilarordissimilarmethodology
nowknownorhereafterdeveloped.Exemptedfromthislegalreservationarebriefexcerptsinconnection
with reviews or scholarly analysis or material supplied specifically for the purpose of being entered
and executed on a computer system, for exclusive use by the purchaser of the work. Duplication of
this publication or parts thereof is permitted only under the provisions of the Copyright Law of the
Publisher’slocation,initscurrentversion,andpermissionforusemustalwaysbeobtainedfromSpringer.
PermissionsforusemaybeobtainedthroughRightsLinkattheCopyrightClearanceCenter.Violations
areliabletoprosecutionundertherespectiveCopyrightLaw.
Theuseofgeneraldescriptivenames,registerednames,trademarks,servicemarks,etc.inthispublication
doesnotimply,evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevant
protectivelawsandregulationsandthereforefreeforgeneraluse.
Whiletheadviceandinformationinthisbookarebelievedtobetrueandaccurateatthedateofpub-
lication,neithertheauthorsnortheeditorsnorthepublishercanacceptanylegalresponsibilityforany
errorsoromissionsthatmaybemade.Thepublishermakesnowarranty,expressorimplied,withrespect
tothematerialcontainedherein.
Printedonacid-freepaper
SpringerispartofSpringerScience+BusinessMedia(www.springer.com)
A mathematician, like a painter or a poet,
is a maker of patterns.
If his patterns are more permanent than theirs,
it is because they are made with ideas.
G.H. Hardy
To my teacher, Prof. Hanfried Lenz
This page intentionally left blank
Preface to the Fourth
Edition
Welcome back, my friends,
to the show that never ends....
Emerson, Lake & Palmer
Once again, the new edition has been thoroughly revised, even though the
changesarelessextensivethanforthethirdedition.(Well,onedoeshopefor
some sort of convergence of the writing process.)
In particular, I have again added some further material: 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.
I have also used this opportunity to discuss several recent research de-
velopments and added quite a few references. Finally, smaller changes and
corrections—mainly to typographical errors—have been made.
Asalways,Iamindebtedtomystudentsandassistantsfortheirattention
andinterest.SpecialthanksareduetoDr.MatthiasTinklwhowasincharge
of the examples classes for a couple of lecture courses based on this text
and also contributed several improved figures, and to one of our students,
Alexander Mu¨ller, for his careful reading and helpful suggestions.
Augsburg Dieter Jungnickel
vii
This page intentionally left blank
Preface to the Third
Edition
The show must go on.
IraGershwin
This new third edition has again been thoroughly revised, even though the
changes are not as extensive as in the second edition. Of course, the general
aims of the book have remained the same.
In particular, I have added some additional material, namely two new
sections concerning graphical codes (which provides a less obvious area of
application and, as I hope, might also interest the reader in the important
field of coding theory) and about two dozen further exercises (as usual, with
solutions). I have also discussed and referenced recent developments, espe-
cially for the travelling salesman problem, where truly impressive new world
records have been achieved. Moreover, the presentation of the material has
beenimprovedinquiteafewplaces,mostnotablyinthechaptersonshortest
paths and colorings. In addition to this, many smaller changes and correc-
tionshavebeenmade,andtheproofsofseveraltheoremshavebeenrewritten
to make them more transparent, or more precise.
Again, I thank my students and assistants for their attention and interest
aswellastheinputtheyprovided.Moreover,Iamindebtedtoseveralreaders
whoalertedmetosome(fortunately,moreorlessminor)problems;andIam,
of course, also grateful for the encouraging comments I have received.
Augsburg Dieter Jungnickel
ix
Description: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 inter
