Networks and algorithms : an introductory approach / Alan Dolan and Joan Aldous.
By: Dolan, Alan
.
Contributor(s): Aldous, Joan.
Material type: 
BookPublisher: Chichester ; New York : J. Wiley & Sons, c1993Description: x, 544 p. : ill. ; 24 cm.ISBN: 0471939927 ; 0471939935.Subject(s): System analysis | Algorithms | Mathematical modelsDDC classification: 511.8 | Item type | Current library | Call number | Copy number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
| General Lending | MTU Bishopstown Library Lending | 511.8 (Browse shelf(Opens below)) | 1 | Available | 00010167 |
Enhanced descriptions from Syndetics:
The authors provide a comprehensive introduction to this topic and its many applications. Detailed solution procedures (usually in the form of an algorithm) are given to a wide range of central network problems. There is also a discussion of the time complexity of algorithms and the theory of NP-completeness. An early chapter provides the basic graph theory required for a study of networks. The presentation, clarity and arrangement of the material make it ideal for independent study as well as for use with conventional teaching. Algorithms are worked through, step-by-step, and problems (with fully worked solutions) are regularly provided to enable students to test and reinforce their learning.
Includes bibliographical references (pages 461-464) and index.
Introduction -- Graphs and digraphs -- Flows in basic networks -- Variations on the basic flow problem -- Multi-terminal flows -- Paths and connectivity -- Longest and shortest path algorithms -- Trees -- Physical networks: modelling -- Electrical networks: matrix equations -- Electrical networks: solving the equations -- Matching problems -- The assignment problem -- The transportation problem -- Critical path analysis -- Scheduling -- Packing problems -- Location problems -- Theory of network analysis -- Algorithms and NP-completeness.