🌷Freshen up your bookshelf with our spring deals 🌷 ️

Recently Viewed

New

Fast Parallel Algorithms for Graph Matching Problems: Combinatorial, Algebraic, and Probabilistic Approach by Marek Karpinski 9780198501626

No reviews yet Write a Review
Booksplease Price: €146.35

  Bookmarks: Included free with every order
  Delivery: We ship to over 200 countries from the UK
  Range: Millions of books available
  Reviews: Booksplease rated "Excellent" on Trustpilot

  FREE UK DELIVERY: When You Buy 3 or More Books - Use code: FREEUKDELIVERY in your cart!

SKU:
9780198501626
MPN:
9780198501626
Out of stock
Availability: Out of stock

Frequently Bought Together:

Total: Inc. VAT
Total: Ex. VAT

Description

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.
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



Book Information
ISBN 9780198501626
Author Marek Karpinski
Format Hardback
Page Count 224
Imprint Clarendon Press
Publisher Oxford University Press
Weight(grams) 463g
Dimensions(mm) 242mm * 161mm * 17mm

Reviews

No reviews yet Write a Review

Booksplease  Reviews


J - United Kingdom

Fast and efficient way to choose and receive books

This is my second experience using Booksplease. Both orders dealt with very quickly and despatched. Now waiting for my next read to drop through the letterbox.

J - United Kingdom

T - United States

Will definitely use again!

Great experience and I have zero concerns. They communicated through the shipping process and if there was any hiccups in it, they let me know. Books arrived in perfect condition as well as being fairly priced. 10/10 recommend. I will definitely shop here again!

T - United States

R - Spain

The shipping was just superior

The shipping was just superior; not even one of the books was in contact with the shipping box -anywhere-, not even a corner or the bottom, so all the books arrived in perfect condition. The international shipping took around 2 weeks, so pretty great too.

R - Spain

J - United Kingdom

Found a hard to get book…

Finding a hard to get book on Booksplease and with it not being an over inflated price was great. Ordering was really easy with updates on despatch. The book was packaged well and in great condition. I will certainly use them again.

J - United Kingdom