Graphs, networks, and algorithms /

Dettagli Bibliografici
Autore principale: Jungnickel, D.
Natura: Printed Book
Lingua:English
German
Pubblicazione: New York: Springer, 2013.
Edizione:Fourth edition.
Serie:Algorithms and computation in mathematics, 5
Soggetti:
Combinatorial optimization.
Graph theory.
LEADER 01682cam a2200301 i 4500
008 121009t20132013gw a b 001 0 eng
999 |c 136084  |d 136084 
010 |a  2012951158 
020 |a 9783642322778 (hardcover : alk. paper) 
020 |a 3642322778 (hardcover : alk. paper) 
041 1 |a eng  |h ger 
100 1 |a Jungnickel, D. 
245 1 0 |a Graphs, networks, and algorithms /  |c Dieter Jungnickel. 
250 |a Fourth edition. 
260 |a New York:  |b Springer,  |c 2013. 
300 |a xx, 675 pages :  |b illustrations ;  |c 24 cm. 
490 0 |a Algorithms and computation in mathematics,  |x 1431-1550 ;  |v 5 
500 |a Earlier editions published in 1998, 2004, and 2008. 
504 |a Includes bibliographical references (pages 629-659) and index. 
505 0 |a 1. 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 |a Combinatorial optimization. 
650 0 |a Graph theory. 
942 |c BK 
240 1 0 |a Graphen, Netzwerke und Algorithmen.  |l English 
906 |a 7  |b cbc  |c origcop  |d 2  |e ncip  |f 20  |g y-gencatlg 
955 |b rl09 2014-12-01 z-processor  |i rl11 2015-01-10 to Dewey 
955 |a pc17 2012-10-09  |a xh00 2013-02-25 to STM 
952 |0 0  |1 0  |4 0  |7 0  |9 150631  |a MAT  |b MAT  |c ST1  |d 2016-07-26  |g 2979.87  |i 6865  |l 0  |p MAT6865  |r 2016-07-26  |w 2016-07-26  |y BK 

Documenti analoghi