Networks and Graphs - 1st Edition - ISBN: 9781898563914, 9780857099570

Networks and Graphs

1st Edition

Techniques and Computational Methods

Authors: D K Smith
eBook ISBN: 9780857099570
Hardcover ISBN: 9781898563914
Imprint: Woodhead Publishing
Published Date: 1st January 2003
Page Count: 204
Sales tax will be calculated at check-out Price includes VAT/GST
25% off
25% off
25% off
25% off
25% off
20% off
20% off
25% off
25% off
25% off
25% off
25% off
20% off
20% off
25% off
25% off
25% off
25% off
25% off
20% off
20% off
68.95
51.71
51.71
51.71
51.71
51.71
55.16
55.16
89.95
67.46
67.46
67.46
67.46
67.46
71.96
71.96
54.99
41.24
41.24
41.24
41.24
41.24
43.99
43.99
Unavailable
Price includes VAT/GST
× DRM-Free

Easy - Download and start reading immediately. There’s no activation process to access eBooks; all eBooks are fully searchable, and enabled for copying, pasting, and printing.

Flexible - Read on multiple operating systems and devices. Easily read eBooks on smart phones, computers, or any eBook readers, including Kindle.

Open - Buy once, receive and download all available eBook formats, including PDF, EPUB, and Mobi (for Kindle).

Institutional Access

Secure Checkout

Personal information is secured with SSL technology.

Free Shipping

Free global shipping
No minimum order.

Description

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.

Key Features

  • 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

Readership

Senior undergraduate students and graduate students in mathematics, computer science, and operational research

Table of 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.

Details

No. of pages:
204
Language:
English
Copyright:
© Woodhead Publishing 2003
Published:
Imprint:
Woodhead Publishing
eBook ISBN:
9780857099570
Hardcover ISBN:
9781898563914

About the Author

D K Smith

David K. Smith, University of Exeter, UK

Affiliations and Expertise

University of Exeter, UK

Reviews

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

Ratings and Reviews