New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Codice articolo L1-9780198501626

Contatta il venditore

Segnala questo articolo

Dati bibliografici

Titolo: Fast Parallel Algorithms for Graph Matching ...

Casa editrice: Clarendon Press

Data di pubblicazione: 1998

Legatura: HRD

Condizione: New

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

**Please note our transit times are from the date of dispatch.** We first started out as ?The Paperback Exchange,? a chain of physical bookstores where we would part exchange your beloved books for new stories to transport you to faraway places. However, as shopping started to evolve to online shops and marketplaces, we bid our stores goodbye to become ?PBShop.? This transition has only allowed us to blossom as we now ship thousands of titles to book lovers across the globe. We pride ourselves in being a community of local book lovers which allows our passion and devotion to shine in everything we do. In 2020 we not only celebrated our 20th birthday but our 1st birthday as being completely employee owned after becoming an E.O.T in September 2019. We are proud to be different and embrace standing apart on a book mountain by working from a virtual inventory which allows us to provide thousands of books that may be difficult to get for your bookshelf or your studies. Working with a number of different suppliers allows us to explore other avenues such as puzzles, sheet music and even stationery so we really do have something for everyone. Life is about being versatile in all realms of existence. If this is your first purchase with us, or you are a returning customer, we would like to welcome you to the PBShop family, for there is no friend as loyal as a book. We are a company who put our customers at the centre of everything we do as we understand the importance of reading because once you learn to read, you will forever be free. There are a whole lot of things in this world of ours that we are yet to explore, which is why we will forever inspire curious minds.

Visita la pagina della libreria

Informazioni sull?azienda del venditore

Pbshop.co.uk
Unit 22 Horcott Industrial Estate, Horcott Road, Fairford, GL7 4BX, United Kingdom

Condizioni di vendita:

Returns Policy
We ask all customers to contact us for authorisation should they wish to return their order. Orders returned without authorisation may not be credited.
If you wish to return, please contact us within 14 days of receiving your order to obtain authorisation.
Returns requested beyond this time will not be authorised.
Our team will provide full instructions on how to return your order and once received our returns department will process your refund.
Please note the cost to return any...

Ulteriori informazioni

Condizioni di spedizione:

Orders are shipped from our UK warehouse. Delivery thereafter is between 4 and 14 business days. Please contact us if you have any queries about our services or products.

Metodi di pagamento
accettati dalla libreria

Aggiungi ai desiderata

Articoli correlati a Fast Parallel Algorithms for Graph Matching Problems:...

Fast Parallel Algorithms for Graph Matching Problems: Combinatorial, Algebraic, and Probabilistic Approach: 9 (Oxford Lecture Series in Mathematics and Its Applications)

Marek Karpinski

Nuovi - Rilegato

Informazioni sull?azienda del venditore