Articles liés à Fast Parallel Algorithms for Graph Matching Problems:...
Fast Parallel Algorithms for Graph Matching Problems: Combinatorial, Algebraic & Probabilistic Approach - Couverture rigide
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Présentation de l'éditeur
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.
Revue de presse
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
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 154,93
EUR 4,62 expédition depuis Royaume-Uni vers France
Destinations, frais et délaisRésultats de recherche pour Fast Parallel Algorithms for Graph Matching Problems:...
Image fournie par le vendeur
Fast Parallel Algorithms for Graph Matching Problems: Combinatorial, Algebraic & Probabilistic Approach Oxford Lecture Series in Mathematics and Its Applications, 9
Edité par
Oxford University Press, 1998
ISBN 10 : 0198501625
ISBN 13 : 9780198501626
Ancien ou d'occasion
Couverture rigide
Vendeur : books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
gebundene Ausgabe. Etat : Gut. 212 Seiten Das hier angebotene Buch stammt aus einer teilaufgelösten Bibliothek und kann die entsprechenden Kennzeichnungen aufweisen (Rückenschild, Instituts-Stempel.); der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 465. N° de réf. du vendeur 2232250
Quantité disponible : 2 disponible(s)
Image d'archives
Fast Parallel Algorithms for Graph Matching Problems (Oxford Lecture Series in Mathematics and Its Applications) (Volume 9)
Edité par
Clarendon Press, 1998
ISBN 10 : 0198501625
ISBN 13 : 9780198501626
Ancien ou d'occasion
Couverture rigide
Vendeur : Anybook.com, Lincoln, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : Good. Volume 9. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. Clean from markings. In good all round condition. No dust jacket. Library sticker on front cover. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,550grams, ISBN:9780198501626. N° de réf. du vendeur 9289266
Quantité disponible : 1 disponible(s)
Image d'archives
Fast Parallel Algorithms for Graph Matching Problems
Edité par
OXFORD UNIV PR, 1998
ISBN 10 : 0198501625
ISBN 13 : 9780198501626
Ancien ou d'occasion
Couverture rigide
Vendeur : Buchpark, Trebbin, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : Sehr gut. Zustand: Sehr gut | Seiten: 224 | Sprache: Englisch | Produktart: Bücher. N° de réf. du vendeur 3302072/202
Quantité disponible : 2 disponible(s)
Image d'archives
Fast Parallel Algorithms for Graph Matching Problems (Oxford Lecture Series in Mathematics and Its Applications)
Edité par
Clarendon Press, 1995
ISBN 10 : 0198501625
ISBN 13 : 9780198501626
Ancien ou d'occasion
Couverture rigide
Vendeur : Ammareal, Morangis, France
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : Très bon. Ancien livre de bibliothèque avec équipements. Edition 1995. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 1995. Ammareal gives back up to 15% of this item's net price to charity organizations. N° de réf. du vendeur G-083-817
Quantité disponible : 1 disponible(s)
Image d'archives
Fast Parallel Algorithms for Graph Matching Problems (Oxford Lecture Series in Mathematics and Its Applications)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9780198501626_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
Fast Parallel Algorithms for Graph Matching Problems: Combinatorial, Algebraic, and Probabilistic Approach: 9 (Oxford Lecture Series in Mathematics and Its Applications)
impression à la demandeVendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
HRD. Etat : New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. N° de réf. du vendeur L1-9780198501626
Quantité disponible : Plus de 20 disponibles
Image d'archives
Fast Parallel Algorithms for Graph Matching Problems
impression à la demandeVendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
HRD. Etat : New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. N° de réf. du vendeur L1-9780198501626
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Fast Parallel Algorithms for Graph Matching Problems : Combinatorial, Algebraic & Probabilistic Approach
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 79508-n
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Fast Parallel Algorithms for Graph Matching Problems : Combinatorial, Algebraic & Probabilistic Approach
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 79508-n
Quantité disponible : Plus de 20 disponibles
Image d'archives
Fast Parallel Algorithms for Graph Matching Problems (Hardcover)
Edité par
Oxford University Press, Oxford, 1998
ISBN 10 : 0198501625
ISBN 13 : 9780198501626
Neuf
Couverture rigide
Vendeur : AussieBookSeller, Truganina, VIC, Australie
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : new. 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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. N° de réf. du vendeur 9780198501626
Quantité disponible : 1 disponible(s)