Graphs, networks, and algorithms / Dieter Jungnickel.

Author/creator Jungnickel, D., 1952-
Format Electronic
EditionFourth edition.
Publication InfoHeidelberg ; New York : Springer, [2013]
Descriptionxx, 675 pages : illustrations ; 24 cm.
Supplemental ContentFull text available from Springer Books
Supplemental ContentFull text available from Springer Nature - Springer Mathematics and Statistics eBooks 2013 English International
Subjects

Uniform titleGraphen, Netzwerke und Algorithmen. English
SeriesAlgorithms and computation in mathematics, 1431-1550 ; 5
Contents 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.
General noteEarlier editions published in 1998, 2004, and 2008.
Bibliography noteIncludes bibliographical references (pages 629-659) and index.
Access restrictionAvailable only to authorized users.
Technical detailsMode of access: World Wide Web
Genre/formElectronic books.
LCCN 2012951158
ISBN9783642322778 (hardcover : alk. paper)
ISBN3642322778 (hardcover : alk. paper)

Availability

Library Location Call Number Status Item Actions
Electronic Resources ✔ Available