Fast Parallel Algorithms for Graph Matching Problems |
|
| Author:
| Karpinski, Marek
Rytter, Wojciech |
| Series title: | Oxford Lecture Series in Mathematics and Its Applications Ser. |
| ISBN: | 978-0-19-850162-6 |
| Publication Date: | May 1998 |
| Publisher: | Oxford University Press, Incorporated
|
| Imprint: | Clarendon Press |
| Book Format: | Hardback |
| List Price: | USD $180.00 |
Book Description:
|
The matching problem is one of the central problems in graph theory as well as in the theopry of algorithms and their applications. This book will provide the reader with a comprehensive and straightforward introduction to the basic methods of designing efficient parallel algorithms for graph matching problems. The text is written for students at the beginning graduate level. The exposition is mostly self-contained and example-driven. Prerequisites have been kept to a minimum by...
More DescriptionThe matching problem is one of the central problems in graph theory as well as in the theopry of algorithms and their applications. This book will provide the reader with a comprehensive and straightforward introduction to the basic methods of designing efficient parallel algorithms for graph matching problems. The text is written for students at the beginning graduate level. The exposition is mostly self-contained and example-driven. Prerequisites have been kept to a minimum by including relevant background material. The book contains full details of several new techniques and should also be of interest to research workers in computer scince, operations research, discrete mathematics, and electrical engineering.