Algorithmic Graph Theory
James a. McHugh(Author)
Prentice-Hall (Publisher)
Published in March 1990
Book
Paperback/Softback
480 pages
978-0-13-019092-5 (ISBN)
Description
An introduction to graph algorithms and pure graph theory with applications to computer systems. Emphasizing understanding, design, specification and performance, this book provides wide-ranging coverage of algorithms and algorithmic techniques. The author considers recent advances in random and parallel algorithms and includes numerous examples of graph-theoretic modelling. He also presents algorithms using current standards for software specification. He then examines new random and parallel graph processing algorithms, including those on different parallel architectures as well as many shared memory algorithms. There is then coverage of design techniques and design methods, such as divide and conquer and search tree techniques throughout. Finally, the book explores the elements of pure graph theory with exercises covering both graph-theoretical and algorithmic topics.
More details
Language
English
Place of publication
Harlow
United Kingdom
Publishing group
Pearson Education Limited
Target group
College/higher education
Illustrations
bibliography
Dimensions
Height: 232 mm
Width: 179 mm
Weight
534 gr
ISBN-13
978-0-13-019092-5 (9780130190925)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Classification
Content
Introduction to graph theory; algorithmic techniques; shortest paths; trees and acyclic diagraphs; depth first search; connectivity and routing; graph colouring; covers, domination, independent sets, matchings and factors, parallel algorithms; computational complexity.