Table of Contents

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

Reviews

`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