Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Networks and Graphs: Techniques and Computational Methods

Networks and Graphs: Techniques and Computational Methods

Smith, D. K.

Paperback

General ComputersGeneral Mathematics

ISBN10: 1898563918
ISBN13: 9781898563914
Publisher: Woodhead Pub
Published: Jan 1 2003
Pages: 204
Weight: 0.71
Height: 0.46 Width: 6.34 Depth: 9.16
Language: English
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.

Also in

General Mathematics

View All