Graphs, networks, and algorithms / Dieter Jungnickel.
| Author/creator | Jungnickel, D., 1952- |
| Format | Electronic |
| Edition | Fourth edition. |
| Publication Info | Heidelberg ; New York : Springer, [2013] |
| Description | xx, 675 pages : illustrations ; 24 cm. |
| Supplemental Content | Full text available from Springer Books |
| Supplemental Content | Full text available from Springer Nature - Springer Mathematics and Statistics eBooks 2013 English International |
| Subjects |
| Uniform title | Graphen, Netzwerke und Algorithmen. English |
| Series | Algorithms 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 note | Earlier editions published in 1998, 2004, and 2008. |
| Bibliography note | Includes bibliographical references (pages 629-659) and index. |
| Access restriction | Available only to authorized users. |
| Technical details | Mode of access: World Wide Web |
| Genre/form | Electronic books. |
| LCCN | 2012951158 |
| ISBN | 9783642322778 (hardcover : alk. paper) |
| ISBN | 3642322778 (hardcover : alk. paper) |
Availability
| Library | Location | Call Number | Status | Item Actions |
|---|---|---|---|---|
| Electronic Resources | ✔ Available |