LEADER 04609nam 22006975 450 001 9910437865003321 005 20250424094720.0 010 $a3-642-32278-6 024 7 $a10.1007/978-3-642-32278-5 035 $a(CKB)2670000000309168 035 $a(EBL)1082538 035 $a(OCoLC)821031110 035 $a(SSID)ssj0000813407 035 $a(PQKBManifestationID)11433068 035 $a(PQKBTitleCode)TC0000813407 035 $a(PQKBWorkID)10785964 035 $a(PQKB)11461802 035 $a(DE-He213)978-3-642-32278-5 035 $a(MiAaPQ)EBC1082538 035 $a(MiAaPQ)EBC6312971 035 $a(PPN)168321440 035 $a(EXLCZ)992670000000309168 100 $a20121116d2013 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aGraphs, Networks and Algorithms /$fby Dieter Jungnickel 205 $a4th ed. 2013. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2013. 215 $a1 online resource (676 p.) 225 1 $aAlgorithms and Computation in Mathematics,$x2512-3254 300 $aDescription based upon print version of record. 311 08$a3-642-43664-1 311 08$a3-642-32277-8 320 $aIncludes bibliographical references and index. 327 $aPrefaces -- 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. 330 $aFrom 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 forthe more general Berge-Tutte formula. Several recent research developments are discussed and quite a few references have been added. 410 0$aAlgorithms and Computation in Mathematics,$x2512-3254 606 $aDiscrete mathematics 606 $aMathematical optimization 606 $aComputer science$xMathematics 606 $aDiscrete Mathematics 606 $aOptimization 606 $aMathematics of Computing 615 0$aDiscrete mathematics. 615 0$aMathematical optimization. 615 0$aComputer science$xMathematics. 615 14$aDiscrete Mathematics. 615 24$aOptimization. 615 24$aMathematics of Computing. 676 $a511.5 700 $aJungnickel$b Dieter$4aut$4http://id.loc.gov/vocabulary/relators/aut$054470 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910437865003321 996 $aGraphs, networks and algorithms$91417907 997 $aUNINA