01758nam1 22003973i 450 SBL056467020231121125827.0IT759208 20131025d1975 ||||0itac50 baitaitz01i xxxe z01nTeoria e storia degli studi linguisticiatti del settimo Convegno internazionale di studiRoma, 2-3 giugno 1973SLI, Societa di linguistica italianaa cura di Ugo Vignuzzi, Giulianella Ruggiero, Raffaele SimoneRomaBulzoni19752 v. (VI, VI, 610 p. compless.)21 cm.Pubblicazioni della Società di linguistica italiana8001CFI00447772001 Pubblicazioni della Società di linguistica italiana871202Società di linguistica italianaCFIV000982001UBO02537972000 11001UBO02537982000 22LINGUISTICACongressiRoma1973FIRRAVC085740I410Linguistica21Simone, RaffaeleCFIV019608Vignuzzi, UgoCFIV051424Ruggiero, GiulianellaRAVV054456Società di linguistica italianaCFIV000982070330439SLICFIV136316Società di linguistica italianaITIT-0120131025IT-RM028 IT-FR0017 Biblioteca Universitaria AlessandrinaRM028 Biblioteca umanistica Giorgio ApreaFR0017 SBL0564670Biblioteca umanistica Giorgio Aprea 52DFAG L 28.1 52DFAG L 28.2 01 52Teoria e storia degli studi linguistici148396UNICAS04609nam 22006975 450 991043786500332120250424094720.03-642-32278-610.1007/978-3-642-32278-5(CKB)2670000000309168(EBL)1082538(OCoLC)821031110(SSID)ssj0000813407(PQKBManifestationID)11433068(PQKBTitleCode)TC0000813407(PQKBWorkID)10785964(PQKB)11461802(DE-He213)978-3-642-32278-5(MiAaPQ)EBC1082538(MiAaPQ)EBC6312971(PPN)168321440(EXLCZ)99267000000030916820121116d2013 u| 0engur|n|---|||||txtccrGraphs, Networks and Algorithms /by Dieter Jungnickel4th ed. 2013.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2013.1 online resource (676 p.)Algorithms and Computation in Mathematics,2512-3254Description based upon print version of record.3-642-43664-1 3-642-32277-8 Includes bibliographical references and index.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.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 forthe more general Berge-Tutte formula. Several recent research developments are discussed and quite a few references have been added.Algorithms and Computation in Mathematics,2512-3254Discrete mathematicsMathematical optimizationComputer scienceMathematicsDiscrete MathematicsOptimizationMathematics of ComputingDiscrete mathematics.Mathematical optimization.Computer scienceMathematics.Discrete Mathematics.Optimization.Mathematics of Computing.511.5Jungnickel Dieterauthttp://id.loc.gov/vocabulary/relators/aut54470MiAaPQMiAaPQMiAaPQBOOK9910437865003321Graphs, networks and algorithms1417907UNINA