This item is in: Mathematics > Applied mathematics

Networks and graphs: Techniques and Computational Methods

D K Smith, University of Exeter, UK

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

 - 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

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.

ISBN 1 898563 91 8
ISBN-13: 978 1 898563 91 4
January 2003
204 pages  234 x 156mm  hardback  
£50.00 / US$85.00 / €60.00

Usually dispatched within 24 hours

An e-book version of this title is available to purchase as part of a Collection or Pick n Mix or by Chapter. Visit Woodhead Publishing Online

About the author

David K Smith, University of Exeter, UK

Titles which may also be of interest:
Stochastic differential equations and applications
Ordinary differential equations and applications
Linear differential and difference equations

Contents

Introduction

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

Tutorial hints

Books and References