Networks and Graphs

Techniques and Computational Methods
Erscheinungsjahr 2003
ISBN: 978-1-898563-91-4
Verlag: Elsevier Science

Buch, Englisch, 204 Seiten, Format (B × H): 161 mm x 233 mm, Gewicht: 322 g

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.

Autoren/Hrsg.

Smith, D K

Fachgebiete

• Mathematik | Informatik Mathematik Mathematische Analysis
• Mathematik | Informatik EDV | Informatik Informatik

Inhaltsverzeichnis

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.

Über Autor(innen)

Smith, D K
David K. Smith, University of Exeter, UK