Fast Parallel Algorithms for Graph Matching Problems
Karpinski, Marek; Rytter, Wojciech
ISBN 10: 0198501625 ISBN 13: 9780198501626
Verlag: Oxford University Press, 1998
Gebraucht
Hardcover
Verkäufer
OM Books, Sevilla, SE, Spanien
Verkäuferbewertung 5 von 5 Sternen
AbeBooks-Verkäufer seit 27. Januar 2022
Dieser Artikel ist nicht mehr verfügbar.
Beschreibung
Beschreibung:
Bestandsnummer des Verkäufers 9780198501626
Inhaltsangabe:
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Bibliografische Details
Titel: Fast Parallel Algorithms for Graph Matching ...
Verlag: Oxford University Press
Erscheinungsdatum: 1998
Einband: Hardcover
Zustand: Usado - bueno
Beste Suchergebnisse bei AbeBooks
Foto des Verkäufers
Fast Parallel Algorithms for Graph Matching Problems: Combinatorial, Algebraic & Probabilistic Approach Oxford Lecture Series in Mathematics and Its Applications, 9
Verlag:
Oxford University Press, 1998
ISBN 10: 0198501625
ISBN 13: 9780198501626
Gebraucht
Hardcover
Anbieter: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Deutschland
Verkäuferbewertung 5 von 5 Sternen
gebundene Ausgabe. Zustand: 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. Bestandsnummer des Verkäufers 2232250
Gebraucht kaufen
EUR 22,95
EUR 12,95 shipping
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 2 verfügbar
Beispielbild für diese ISBN
Fast Parallel Algorithms for Graph Matching Problems (Oxford Lecture Series in Mathematics and Its Applications) (Volume 9)
Anbieter: Anybook.com, Lincoln, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: 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. Bestandsnummer des Verkäufers 9289266
Gebraucht kaufen
EUR 28,01
EUR 15,26 shipping
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Fast Parallel Algorithms for Graph Matching Problems
Anbieter: Buchpark, Trebbin, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | The matching problem is central to graph theory and the theory of algorithms. This book provides a comprehensive and straightforward introduction to the basic methods for designing efficient parallel algorithms for graph matching problems. Written for students at the beginning graduate level, the exposition is largely 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 will be of interest to researchers in computer science, operations research, discretemathematics, and electrical engineering. The main theoretical tools are presented in three independent chapters, devoted to combinatorial tools, probabilistic tools, and algebraic tools. One of the goals of the book is to show how these three approaches can be combined to develop efficient parallelalgorithms. The book represents a meeting point of interesting algorithmic techniques and opens up new algebraic and geometric areas. Bestandsnummer des Verkäufers 3302072/202
Gebraucht kaufen
EUR 67,97
EUR 105,00 shipping
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 2 verfügbar
Beispielbild für diese ISBN
Fast Parallel Algorithms for Graph Matching Problems (Hardcover)
Verlag:
Oxford University Press, Oxford, 1998
ISBN 10: 0198501625
ISBN 13: 9780198501626
Neu
Hardcover
Anbieter: AussieBookSeller, Truganina, VIC, Australien
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: 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. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Bestandsnummer des Verkäufers 9780198501626
Neu kaufen
EUR 146,83
EUR 31,52 shipping
Versand von Australien nach USA
Versand von Australien nach USA
Anzahl: 1 verfügbar
Foto des Verkäufers
Fast Parallel Algorithms for Graph Matching Problems : Combinatorial, Algebraic & Probabilistic Approach
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers 79508-n
Neu kaufen
EUR 152,54
EUR 17,08 shipping
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Fast Parallel Algorithms for Graph Matching Problems
Print-on-DemandAnbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
HRD. Zustand: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Bestandsnummer des Verkäufers L1-9780198501626
Neu kaufen
EUR 152,55
EUR 5,72 shipping
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Fast Parallel Algorithms for Graph Matching Problems : Combinatorial, Algebraic & Probabilistic Approach
Anbieter: GreatBookPrices, Columbia, MD, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers 79508-n
Neu kaufen
EUR 154,75
EUR 2,25 shipping
Versand innerhalb von USA
Versand innerhalb von USA
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Fast Parallel Algorithms for Graph Matching Problems
Print-on-DemandAnbieter: PBShop.store US, Wood Dale, IL, USA
Verkäuferbewertung 5 von 5 Sternen
HRD. Zustand: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Bestandsnummer des Verkäufers L1-9780198501626
Neu kaufen
EUR 157,07
Versand gratis
Versand innerhalb von USA
Versand innerhalb von USA
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Fast Parallel Algorithms for Graph Matching Problems (Hardcover)
Verlag:
Oxford University Press, Oxford, 1998
ISBN 10: 0198501625
ISBN 13: 9780198501626
Neu
Hardcover
Anbieter: CitiRetail, Stevenage, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: 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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Bestandsnummer des Verkäufers 9780198501626
Neu kaufen
EUR 161,28
EUR 42,14 shipping
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: 1 verfügbar
Foto des Verkäufers
Fast Parallel Algorithms for Graph Matching Problems : Combinatorial, Algebraic & Probabilistic Approach
Anbieter: GreatBookPrices, Columbia, MD, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: As New. Unread book in perfect condition. Bestandsnummer des Verkäufers 79508
Gebraucht kaufen
EUR 165,61
EUR 2,25 shipping
Versand innerhalb von USA
Versand innerhalb von USA
Anzahl: Mehr als 20 verfügbar