| Record ID | marc_loc_2016/BooksAll.2016.part40.utf8:190394964:1648 |
| Source | Library of Congress |
| Download Link | /show-records/marc_loc_2016/BooksAll.2016.part40.utf8:190394964:1648?format=raw |
LEADER: 01648cam a2200337 i 4500
001 2012951158
003 DLC
005 20150112133944.0
008 121009t20132013gw a b 001 0 eng
010 $a 2012951158
020 $a9783642322778 (hardcover : alk. paper)
020 $a3642322778 (hardcover : alk. paper)
040 $aDLC$beng$erda$cDLC
041 1 $aeng$hger
050 00 $aQA402.5$b.J8913 2013
100 1 $aJungnickel, D.$q(Dieter),$d1952-
240 10 $aGraphen, Netzwerke und Algorithmen.$lEnglish
245 10 $aGraphs, networks, and algorithms /$cDieter Jungnickel.
250 $aFourth edition.
264 1 $aHeidelberg ;$aNew York :$bSpringer,$c[2013]
264 4 $c©2013
300 $axx, 675 pages :$billustrations ;$c24 cm.
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
338 $avolume$bnc$2rdacarrier
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.
650 0 $aGraph theory.