Graphs, networks, and algorithms - Jungnickel, Dieter (New York: Springer-Verlag, 2013)
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.
Earlier editions published in 1998, 2004, and 2008.
Includes bibliographical references (pages 629-659) and index.
Keywords: Combinatorial optimization; Graph theory