Fast Parallel Algorithms for Graph Matching Problems

Lingua: inglese

Editore: Oxford University Press, GB, 1998

0198501625 / 9780198501626

Da: Rarewaves.com UK, London, Regno UnitoRarewaves.com UK

Venditore con 5 stelle

Venditore AbeBooks dal 11 giugno 2025

Rilegato

Condizione: Nuovo

EUR 271,95

EUR 77,65 spedizione 
Spedito da Regno Unito a U.S.A.

Quantità: Più di 20 disponibili

Aggiungi al carrello
Resi gratuiti per 30 giorni

Descrizione dell’articolo da parte del venditore

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

Codice articolo LU-9780198501626

Titolo
Fast Parallel Algorithms for Graph Matching Problems
Autore
Marek Karpinski, Wojciech Rytter
Editore
Oxford University Press, GB
Anno di pubblicazione
1998
Condizione
New
Rilegatura
Hardback
Lingua
inglese
ISBN 10
0198501625
ISBN 13
9780198501626
Edizione
Illustrated.
Peso dell'articolo
463 grammi
Dimensioni
16 x 2.03 x 23.62 cm

Rarewaves.com UK

London, Regno Unito

Venditore con 5 stelle

Venditore AbeBooks dal 11 giugno 2025

Tariffe di spedizione da Regno Unito a U.S.A.

ArticoloDa 60 a 60 giorni lavorativiDa 60 a 60 giorni lavorativi
Primo articoloEUR 77,65EUR 119,46
I tempi di consegna sono stabiliti dai venditori e variano in base al corriere e al paese. Gli ordini che devono attraversare una dogana possono subire ritardi e spetta agli acquirenti pagare eventuali tariffe o dazi associati. I venditori possono contattarti in merito ad addebiti aggiuntivi dovuti a eventuali maggiorazioni dei costi di spedizione dei tuoi articoli.

Metodi di pagamento

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

Informazioni sull’azienda del venditore

RAREWAVES.COM LIMITED

Elsley Court, 20-22 Great Titchfield Street
London, Regno Unito W1W 8BE