Networks and Graphs - Techniques and Computational Methods (Hardcover)

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 researchDemonstrates how algorithms can be used for finding optimal paths and flows, identifying trees in networks and optimal matchingNumerous examples and diagrams illustrate the techniques and applications"

General

Imprint:	Horwood Publishing Ltd
Country of origin:	United Kingdom
Release date:	2003
First published:	2003
Authors:	D. K Smith
Dimensions:	230 x 156 x 13mm (L x W x T)
Format:	Hardcover
Pages:	204
ISBN-13:	978-1-898563-91-4
Categories:	Books > Science & Mathematics > Mathematics > General Promotions
LSN:	1-898563-91-8
Barcode:	9781898563914

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!