Articles liés à Networks and Graphs: Techniques and Computational Methods

Networks and Graphs: Techniques and Computational Methods - Couverture rigide

Smith, D K

 
9781898563914: Networks and Graphs: Techniques and Computational Methods
Couverture rigide
ISBN 10 : 1898563918 ISBN 13 : 9781898563914
Editeur : Horwood Publishing Ltd, 2003

Synopsis

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. Problem exercises with tutorial hints. <P>Contents: 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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

À propos de l'auteur

David K. Smith, University of Exeter, UK

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
Horwood Publishing Ltd
Date d'édition
2003
Langue
anglais
ISBN 10 
1898563918
ISBN 13 
9781898563914
Reliure
Relié
Nombre de pages
204
Coordonnées du fabricant
non disponible
Personne responsable
non disponible