Networks and Graphs

  • ID: 2736258
  • Book
  • 204 Pages
  • Elsevier Science and Technology
1 of 4
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.

- Presents essential mathematical and computational ideas of network optimisation for senior undergraduate and postgraduate students in mathematics, computer science and operational research- Demonstrates how algorithms can be used for finding optimal paths and flows, identifying trees in networks and optimal matching- Numerous examples and diagrams illustrate the techniques and applications

Please Note: This is an On Demand product, delivery may take up to 11 working days after payment has been received.
Note: Product cover images may vary from those shown
2 of 4
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.
Note: Product cover images may vary from those shown
3 of 4

Loading
LOADING...

4 of 4
Smith, D KDavid K. Smith, University of Exeter, UK
Note: Product cover images may vary from those shown
5 of 4
Note: Product cover images may vary from those shown
Adroll
adroll