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.

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

Store Description

Librería on-line de libros usados

Visit Seller's Storefront

Seller's business information

OASIS MEDIA BOOKS SC
CALLE TUCUMAN, NUM. 7 PLANTA 7, PUERTA C, Sevilla, 41006, Spain

Sale & Shipping Terms

Terms of Sale

Librería on-line de libros usados

Shipping Terms

Los gastos de envío se calculan para envíos estándar.

Orders usually ship within 2 business days. Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.