Ancien livre de biblioth�que avec �quipements. Edition 1995. Ammareal reverse jusqu'� 15% du prix net de cet article � des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 1995. Ammareal gives back up to 15% of this item's net price to charity organizations. Codice articolo G-083-817

Contatta il venditore

Segnala questo articolo

Dati bibliografici

Titolo: Fast Parallel Algorithms for Graph Matching ...

Casa editrice: Clarendon Press

Data di pubblicazione: 1995

Legatura: Hardcover

Condizione: Tr�s bon

Descrizione articolo

Riassunto:

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.

Recensione:

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

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Descrizione libreria

English below. Ammareal est une librairie professionnelle sp�cialis�e dans le livre d?occasion. Nous exp�dions partout dans le monde. Nous avons plus de 250 000 ouvrages en stock dont un grand nombre de livres techniques et acad�miques. Nous reversons jusqu?� 15% du prix de vente de chaque livre � des organisations caritatives, des biblioth�ques et des associations luttant contre l?illettrisme. Ce que nous ne vendons pas nous le donnons, ce que nous ne donnons pas nous le recyclons. Ammareal is a professional bookseller speciliazed in used books. We ship worldwide. We have more than 250 000 books in stock, including a large number of technical and university-level books. We give back up to 15% of the price of each book to charities, libraries and organizations fighting in favor of literacy. What we do not sell, we give, what we do not give we recycle.

Visita la pagina della libreria