Basic Graph and Network Algorithms (Butterworths Basic Series) - Softcover

Mole, Richard H.

Softcover

ISBN 10: 0408012625 ISBN 13: 9780408012621

Publisher: Butterworth-Heinemann, 1989

Synopsis

This is a computer-integrated text on graph and network algorithms primarily for introductory use by undergraduates and diploma students. It is designed to fill the gap between courses on graphy theory at an elementary level and courses centred on detailed computational considerations. An algorithm is a set of computational instructions and most graph and network algorithms specify a considerable volume of quite elementary calculations and data manipulations. Consequently, it is helpful to have computer programs available when studying graph and network algorithms for the first time. Graph and network models are used in computer science, management science and other branches of science and technology. The work summarizes the main ideas of the BASIC programming language and goes on to introduce some of the main ideas of graph and network models, together with a range of applications and a discussion of the ways of representing graphs and networks to facilitate computer calculation. Worked examples, algorithms, program descriptions and individual BASIC computer programs with sample RUNs for many of the important algorithms are included. The author considers graph connectivity using the Euler tour as an example of a construction problem, Hamiltonian tours as an example of an enumeration problem and the Shortest Spanning Tree as an example of an optimization problem. The work concludes with a look at some important shortest path algorithms and some important maximum flow and minimum-cost maximum flow algorithms for networks. Short, annotated bibliographies, references at the end of each chapter and a total of 70 exercises are included.

Edition details

• Publisher: Butterworth-Heinemann
• Publication date: 1989
• ISBN 10: 0408012625
• ISBN 13: 9780408012621
• Binding: Paperback
• Language: English
• Number of pages: 169