Networks and Graphs: Techniques and Computational Methods
| By: | Smith, D K |
| Publisher: | Elsevier S & T |
| Print ISBN: | 9781898563914 |
| eText ISBN: | 9780857099570 |
| Edition: | 0 |
| Format: | Page Fidelity |
eBook Features
Instant Access
Purchase and read your book immediately
Read Offline
Access your eTextbook anytime and anywhere
Study Tools
Built-in study tools like highlights and more
Read Aloud
Listen and follow along as Bookshelf reads to you
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