Fast Parallel Algorithms for Graph Matching Problems

Language: English

Published by Oxford University Press, GB, 1998

0198501625 / 9780198501626

  • Hardcover
  • New
See all details

Seller: Rarewaves.com UK, London, United KingdomRarewaves.com UK

5-star seller

AbeBooks seller since June 11, 2025

View this seller's items
Hardcover

Condition: New

£ 220.71

£ 65.00 shipping 
Ships from United Kingdom to U.S.A.

Quantity: Over 20 available

Add to basket
Free 30-day returns

Item description from seller

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.

Seller Inventory # LU-9780198501626

Title
Fast Parallel Algorithms for Graph Matching Problems
Author
Marek Karpinski, Wojciech Rytter
Publisher
Oxford University Press, GB
Publication year
1998
Condition
New
Binding
Hardback
Language
English
ISBN 10
0198501625
ISBN 13
9780198501626
Edition
Illustrated.
Item weight
463 grams
Dimensions
16 x 2.03 x 23.62 cm

Rarewaves.com UK

London, United Kingdom

5-star seller

AbeBooks seller since June 11, 2025

Shipping rates from United Kingdom to U.S.A.

Item60 to 60 business days60 to 60 business days
First item£ 65.00£ 100.00
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.

Payment methods

  • Visa
  • Mastercard
  • American Express
  • Apple Pay
  • Google Pay

Seller's business information

RAREWAVES.COM LIMITED

Elsley Court, 20-22 Great Titchfield Street
London, United Kingdom W1W 8BE