000			02753nam a22003855i 4500
001			293703
003			MX-SnUAN
005			20160429155117.0
007			cr nn 008mamaa
008			150903s2005 gw | o |||| 0|eng d
020			_a9783540269083 _99783540269083
024	7		_a10.1007/b138283 _2doi
035			_avtls000346770
039		9	_a201509030400 _bVLOAD _c201405070511 _dVLOAD _y201402070905 _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			_aSecond Edition.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2005.
300			_axvI, 611 páginas 195 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		_aBasic 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.
520			_aFrom the reviews of the first edition: ".... 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. ..." Mathematical Reviews 2002 This thoroughly revised new edition offers a new chapter on the network simplex algorithm and a section on the five color theorem. Moreover, numerous smaller changes and corrections have been made and several recent developments have been discussed and referenced.
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: _z9783540219057
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/b138283 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c293703 _d293703