Networks and Graphs: Techniques and Computational Methods
David Keith Smith · 2003
Ideas and definitions Trees Shortest paths Maximum flows How to store a network More about shortest paths Advanced maximal flow Minimal-cost, feasible-flow Matching and assignment Postman problems Travelling salesperson problems Tutorial hints References Index.