Fast Parallel Algorithms for Graph Matching Problems (Hardcover)

Langue : anglais

Edité par Oxford University Press, Oxford, 1998

0198501625 / 9780198501626

Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-UnisGrand Eagle Retail

Vendeur avec une évaluation de 5 étoiles

Vendeur AbeBooks depuis 12 octobre 2005

Livre relié

Etat: Neuf

EUR 242,23

 Frais de port gratuits 
Expédition nationale : Etats-Unis

Quantité disponible : 1 disponible

Ajouter au panier
Retours gratuits sous 30 jours

A propos de cet article

Hardcover. 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 toa 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, operationsresearch, 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 representsa 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. Part of the OXFORD LECTURE SERIES IN MATHEMATICS AND ITS APPLICATIONS series, a comprehensive and straightforward introduction to the basic methods of designing efficient parallel algorithms for graph matching problems. Appropriate for students at undergraduate level. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

N° de réf. du vendeur 9780198501626

Titre
Fast Parallel Algorithms for Graph Matching Problems (Hardcover)
Auteur
Marek Karpinski
Éditeur
Oxford University Press, Oxford
Année de publication
1998
État de l'article
new
Reliure
Hardcover
Langue
anglais
ISBN à 10 chiffres
0198501625
ISBN à 13 chiffres
9780198501626

Grand Eagle Retail

Bensenville, IL, Etats-Unis

Vendeur avec une évaluation de 5 étoiles

Vendeur AbeBooks depuis 12 octobre 2005

Frais d'expédition à l'intérieur de ce pays : Etats-Unis

Article6 à 14 jours ouvrés6 à 16 jours ouvrés
Premier articleEUR 0,00EUR 0,00
Les délais de livraison sont fixés par les vendeurs et varient en fonction du transporteur et du lieu. Les commandes transitant par les douanes peuvent être retardées et les acheteurs sont responsables de tous les droits ou frais associés. Les vendeurs peuvent vous contacter au sujet de frais supplémentaires afin de couvrir toute augmentation des coûts d'expédition de vos articles.

Modes de paiement

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

Profil professionnel du vendeur

APOLLO ONLINE CORP.

605 Geddes Street
Wilmington, DE Etats-Unis 19805