Items related to Fast Parallel Algorithms for Graph Matching Problems...

Fast Parallel Algorithms for Graph Matching Problems (Oxford Lecture Series in Mathematics and Its Applications) - Hardcover

Karpinski, Marek; Rytter, Wojciech

 
9780198501626: Fast Parallel Algorithms for Graph Matching Problems (Oxford Lecture Series in Mathematics and Its Applications)
Hardcover
ISBN 10: 0198501625 ISBN 13: 9780198501626
Publisher: Clarendon Press, 1998

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.

"synopsis" may belong to another edition of this title.

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.

"About this title" may belong to another edition of this title.

Publisher
Clarendon Press
Publication date
1998
Language
English
ISBN 10 
0198501625
ISBN 13 
9780198501626
Binding
Hardcover
Edition number
1
Number of pages
224