Fast Parallel Algorithms for Graph Matching Problems

Karpinski Marek Rytter Wojciech

ISBN 10: 0198501625 / ISBN 13: 9780198501626

Published by Oxford University Press, 1998

About this Item

Print on Demand pp. 228 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.

Seller Inventory # 5571501

Bibliographic Details

• Title: Fast Parallel Algorithms for Graph Matching Problems
• Publisher: Oxford University Press
• Publication Date: 1998
• Language: English
• ISBN 10: 0198501625
• ISBN 13: 9780198501626
• Binding: Hardcover
• Condition: New

About this title

Synopsis

The matching problem is central to graph theory and the theory of algorithms. This book provides a comprehensive and straightforward introduction to the basic methods for designing efficient parallel algorithms for graph matching problems. Written for students at the beginning graduate level, the exposition is largely 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 will be of interest to researchers in computer science, operations research, discrete mathematics, and electrical engineering. The main theoretical tools are presented in three independent chapters, devoted to combinatorial tools, probabilistic tools, and algebraic tools. One of the goals of the book is to show how these three approaches can be combined to develop efficient parallel algorithms. The book represents a meeting point of interesting algorithmic techniques and opens up new algebraic and geometric areas.

About the Author

Marek Karpinski is a Chair Professor of Computer Science at University of Bonn. Wojciech Rytter is a Professor of Computer Science at the University of Warsaw, Poland, and University of Liverpool.