Networks and Graphs

Techniques and Computational Methods

D K Smith

• Publisher: Woodhead Publishing
• Year: 2003
• Print ISBN: 9781898563914
• eBook ISBN: 9780857099570
• Topic: Mathematics
• Subtopic: Computer Science General
• Index: Mathematics

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

Table of contents

• Front Cover
• Networks and Graphs: Techniques and Computational Methods
• Copyright Page
• Table of Contents
• ABOUT OUR AUTHOR
• Preface
• Chapter 1. Introduction
• Chapter 2. Trees
• Chapter 3. Shortest Paths
• Chapter 4. Maximum Flows
• Chapter 5. How to Store a Network
• Chapter 6. More about Shortest Paths
• Chapter 7. Advanced Maximal Flow
• Chapter 8. Minimum-Cost Feasible-Flow
• Chapter 9. Matching and Assignment
• Chapter 10. Postman Problems
• Chapter 11. Travelling Salesperson
• Chapter 12. Tutorial hints
• Books and References
• Index