000 03970nam a22003855i 4500
001 306834
003 MX-SnUAN
005 20160429160057.0
007 cr nn 008mamaa
008 150903s2013 gw | o |||| 0|eng d
020 _a9783642322785
_99783642322785
024 7 _a10.1007/9783642322785
_2doi
035 _avtls000359897
039 9 _a201509030559
_bVLOAD
_c201405070251
_dVLOAD
_y201402201420
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA164-167.2
100 1 _aJungnickel, Dieter.
_eautor
_9326559
245 1 0 _aGraphs, Networks and Algorithms /
_cby Dieter Jungnickel.
250 _a4th ed. 2013.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2013.
300 _axx, 675 páginas 211 ilustraciones
_brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
490 0 _aAlgorithms and Computation in Mathematics,
_x1431-1550 ;
_v5
500 _aSpringer eBooks
505 0 _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.
520 _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 for the more general Berge-Tutte formula. Several recent research developments are discussed and quite a few references have been added.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9783642322778
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-642-32278-5
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c306834
_d306834