Networks and Graphs
Techniques and Computational Methods

D K Smith (Author)

9781898563914, Elsevier Science

Hardback, published 1 January 2003

204 pages
23.3 x 15.6 x 2 cm, 0.29 kg

"This book provides a comprehensive account of developments within the subject area of graphs and networks that is associated with discrete mathematics. Important historical background is included along with descriptions of more recent computational advances. ...an excellent monograph that should be read by anyone with an interest in algorithms on graphs." --Dr S.C. Roy, Harrison Allen Education Service, UK

Dr Smith here presents essential mathematical and computational ideas of network optimisation for senior undergraduate and postgraduate students in mathematics, computer science and operational research. He shows how algorithms can be used for finding optimal paths and flows, identifying trees in networks, and optimal matching. Later chapters discuss postman and salesperson tours, and demonstrate how many network problems are related to the ‘‘minimal-cost feasible-flow’’ problem. Techniques are presented both informally and with mathematical rigour and aspects of computation, especially of complexity, have been included. Numerous examples and diagrams illustrate the techniques and applications. The book also includes problem exercises with tutorial hints.

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.

Subject Areas: Computer science [UY], Optimization [PBU], Calculus [PBKA], Calculus & mathematical analysis [PBK], Discrete mathematics [PBD]