+612 9045 4394
 
CHECKOUT
Fast Parallel Algorithms for Graph Matching Problems : Combinatorial, Algebraic, and Probabilistic Approach - Marek Karpinski

Fast Parallel Algorithms for Graph Matching Problems

Combinatorial, Algebraic, and Probabilistic Approach

Hardcover

Published: 1st February 1998
RRP $191.95
$123.50
36%
OFF
or 4 easy payments of $30.88 with Learn more
This title is not in stock at the Booktopia Warehouse and needs to be ordered from our supplier.
Click here to read more about delivery expectations.

The matching problem is one of the central problems in graph theory as well as in the theory 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 science, operations research, discrete mathematics, and electrical engineering. The main theoretical tools are combined into three independent chapters, devoted to combinatorial tools, probabilistic tools, and algebraic tools. One of the main goals of the book is to bring together these three approaches and highlight how their combination works in the development of efficient parallel algorithms. The reader will be provided with a simple and transparent presentation of a variety of interesting algorithms, including many examples and illustrations. The combination of different approaches makes the matching problem and its applications an attractive and fascinating subject. It is hoped that the book represents a meeting point of interesting algorithmic techniques and opens up new algebraic and geometric areas. Marek Karpinski is Chair Professor of Computer Science at the University of Bonn. Wojciech Rytter is Professor of Computer Science at the University of Warsaw and at the University of Liverpool.

`This book provides the graduate students with a comprehensive and straightforward introduction to the basic methods of designing efficient parallel algorithms for graph matching problems.' Technique/Scientifique June 1998 'The book presents for the first time interesting and important results on matching ( and vertex packing) in parallel, which heretofore existed only in scattered journal articles, and hence it should now become the standard reference for anyone who wishes to work in the area' SIAM Review

Preface 1 Introduction: 2 Combinatorial tools: 3 Three sequential algorithms: 4 Probabilistic tools: 5 Algebraic tools: 6 Maximum cardinality polynomials: 7 Inclusion maximal matchings: 8 Maximal independent sets: 9 Four easy subclasses of graphs: 10 Convex bipartite graphs: 11 f-Matchings: 12 Parallelization of sequential algorithms: 13 Pfaffians, counting the number of matchings, and planar graphs: 14 Basic applications of matchings to other problems: 15 More applications: Bibliography

ISBN: 9780198501626
ISBN-10: 0198501625
Series: Oxford Lecture Series in Mathematics and Its Applications
Audience: Professional
Format: Hardcover
Language: English
Number Of Pages: 224
Published: 1st February 1998
Publisher: Oxford University Press
Country of Publication: GB
Dimensions (cm): 24.2 x 16.1  x 1.7
Weight (kg): 0.46