000			01701nam a2200385 i 4500
001			000285040
003			UVAL
005			20240507121744.0
006			a|||||r|||| 00| 0
007			ta
008			221103t2013 gw a b 001 0 eng
020			_a9783642322778
040			_aDIBRA _bspa _erda _cUVAL
041	1		_aeng _hger
082	0	4	_223 _a511.6
100	1		_aJungnickel, D. _q(Dieter), _d1952- _eautor. _9237837.
240	1	0	_aGraphen, Netzwerke und Algorithmen. _lEnglish
245	1	0	_aGraphs, networks, and algorithms / _cDieter Jungnickel.
250			_aFourth edition.
264		1	_aHeidelberg ; _aNew York : _bSpringer, _c[2013].
264		4	_c©2013
300			_axx, 675 páginas : _bilustraciones.
347			_2rda _atext file _bPDF
490	0		_aAlgorithms and computation in mathematics, _x1431-1550 ; _v5
500			_aEarlier editions published in 1998, 2004, and 2008.
500			_aIncluye índice.
504			_aBibliografía: páginas 629-659.
505	0		_a1. Basic graph theory -- 2. Algorithms and complexity -- 3. Shortest paths -- 4. Spanning trees -- 5. The greedy algorithm -- 6. Flows -- 7. Combinatorial applications -- 8. Connectivity and depth first search -- 9. Colorings -- 10. Circulations -- 11. The network simplex algorithm -- 12. Synthesis of networks -- 13. Matchings -- 14. Weighted matchings -- 15. A hard problem: the TSP -- Appendix A. Some NP-complete problems -- Appendix B. Solutions -- Appendix C. List of symbols.
650	1	4	_aOPTIMIZACION COMBINATORIA _9176077.
650	1	4	_aTEORIA DE GRAFOS _95020.
942			_2ddc _cBK
999			_c285040 _d285040