000			01703cam a2200349 i 4500
001			17487048
003			OSt
005			20250313153532.0
008			121009t20132013gw a b 001 0 eng
010			_a 2012951158
020			_a9783642436642 (Pbk)
040			_aDLC _beng _erda _cIISERB
041	1		_aeng _hger
050	0	0	_aQA402.5 _b.J8913 2013
082			_223 _a511.5 J95G4
100	1		_aJungnickel, Dieter. _931765
240	1	0	_aGraphen, Netzwerke und Algorithmen. _lEnglish
245	1	0	_aGraphs, networks, and algorithms / _cDieter Jungnickel.
250			_aFourth edition.
260			_aNew York: _bSpringer-Verlag, _c2013.
300			_axx, 675 pages : _billustrations ; _c24 cm.
490	0		_aAlgorithms and computation in mathematics, _x1431-1550 ; _v5
500			_aEarlier editions published in 1998, 2004, and 2008.
504			_aIncludes bibliographical references (pages 629-659) and index.
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		0	_aCombinatorial optimization. _931766
650		0	_aGraph theory. _931767
906			_a7 _bcbc _corigcop _d2 _encip _f20 _gy-gencatlg
942			_2ddc _cBK
999			_c10726 _d10726