You have Guest access.
Log In
Dieter Jungnickel
I-XIX
Front matter
1-32
Basic Graph Theory
33-58
Algorithms and Complexity
59-95
Shortest Paths
97-125
Spanning Trees
127-151
The Greedy Algorithm
153-208
Flows
209-237
Combinatorial Applications
239-260
Connectivity and Depth First Search
261-278
Colorings
279-341
Circulations
343-361
The Network Simplex Algorithm
363-386
Synthesis of Networks
387-417
Matchings
419-456
Weighted matchings
457-500
A Hard Problem: The TSP
501-650
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info