Items related to 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) - Hardcover
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.
"synopsis" may belong to another edition of this title.
Review
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
"About this title" may belong to another edition of this title.
Search results for Fast Parallel Algorithms for Graph Matching Problems:...
Seller Image
Fast Parallel Algorithms for Graph Matching Problems: Combinatorial, Algebraic & Probabilistic Approach Oxford Lecture Series in Mathematics and Its Applications, 9
Published by
Oxford University Press, 1998
ISBN 10: 0198501625
ISBN 13: 9780198501626
Used
Hardcover
Seller: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Germany
Seller rating 5 out of 5 stars
gebundene Ausgabe. Condition: 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. Seller Inventory # 2232250
Quantity: 2 available
Stock Image
Fast Parallel Algorithms for Graph Matching Problems (Oxford Lecture Series in Mathematics and Its Applications) (Volume 9)
Seller: Anybook.com, Lincoln, United Kingdom
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # 9289266
Quantity: 1 available
Stock Image
Fast Parallel Algorithms for Graph Matching Problems
Seller: Buchpark, Trebbin, Germany
Seller rating 5 out of 5 stars
Condition: Sehr gut. Zustand: Sehr gut | Seiten: 224 | Sprache: Englisch | Produktart: Bücher. Seller Inventory # 3302072/202
Quantity: 2 available
Stock Image
Fast Parallel Algorithms for Graph Matching Problems (Oxford Lecture Series in Mathematics and Its Applications)
Seller: Ammareal, Morangis, France
Seller rating 5 out of 5 stars
Hardcover. Condition: 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. Seller Inventory # G-083-817
Quantity: 1 available
Seller Image
Fast Parallel Algorithms for Graph Matching Problems : Combinatorial, Algebraic & Probabilistic Approach
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 79508-n
Quantity: Over 20 available
Stock Image
Fast Parallel Algorithms for Graph Matching Problems (Oxford Lecture Series in Mathematics and Its Applications)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9780198501626_new
Quantity: Over 20 available
Stock Image
Fast Parallel Algorithms for Graph Matching Problems: Combinatorial, Algebraic, and Probabilistic Approach: 9 (Oxford Lecture Series in Mathematics and Its Applications)
Print on DemandSeller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
HRD. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L1-9780198501626
Quantity: Over 20 available
Stock Image
Fast Parallel Algorithms for Graph Matching Problems (Hardcover)
Published by
Oxford University Press, Oxford, 1998
ISBN 10: 0198501625
ISBN 13: 9780198501626
New
Hardcover
Seller: CitiRetail, Stevenage, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: 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 UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9780198501626
Quantity: 1 available
Stock Image
Fast Parallel Algorithms for Graph Matching Problems
Print on DemandSeller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
HRD. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L1-9780198501626
Quantity: Over 20 available
Seller Image
Fast Parallel Algorithms for Graph Matching Problems : Combinatorial, Algebraic & Probabilistic Approach
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 79508
Quantity: Over 20 available