9780198501626 - fast parallel algorithms for graph matching problems: combinatorial, algebraic, and probabilistic approach: 9 (oxford lecture series in mathematics and its applications) de karpinski, marek; rytter, wojciech (22 resultados)
- Tapa dura
Librería: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Alemaniabooks4less (Versandantiquariat Petra Gros GmbH & Co. KG)
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Bueno
EUR 22,95
Envío por EUR 15,95Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
gebundene Ausgabe. Condición: 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.
- Tapa dura
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de AmericaPBShop.store US
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Bueno
EUR 159,11
Gastos de envío gratisSe envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponibles
HRD. Condición: Used - Very Good. Used - Like New Book. Shipped from UK. Established seller since 2000.
- Tapa dura
Librería: PBShop.store UK, Fairford, GLOS, Reino UnidoPBShop.store UK
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Bueno
EUR 157,26
Envío por EUR 5,86Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
HRD. Condición: Used - Very Good. Used - Like New Book. Shipped from UK. Established seller since 2000.
- Tapa dura
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrlandaKennys Bookshop and Art Galleries Ltd.
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 171,94
Envío por EUR 9,50Se envía de Irlanda a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New. 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. Series: Oxford Lecture Series in Mathematics…& Its Applications. Num Pages: 224 pages, line figures. BIC Classification: PBV; PBW. Category: (P) Professional & Vocational. Dimension: 242 x 161 x 17. Weight in Grams: 463. . 1998. Illustrated. hardcover. . . . .
- Tapa dura
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de AmericaGreatBookPrices
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 189,86
Envío por EUR 2,26Se envía dentro de Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New.
- Tapa dura
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de AmericaKennys Bookstore
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 211,58
Envío por EUR 8,99Se envía dentro de Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New. 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. Series: Oxford Lecture Series in Mathematics…& Its Applications. Num Pages: 224 pages, line figures. BIC Classification: PBV; PBW. Category: (P) Professional & Vocational. Dimension: 242 x 161 x 17. Weight in Grams: 463. . 1998. Illustrated. hardcover. . . . . Books ship from the US and Ireland.
- Tapa dura
Librería: GreatBookPricesUK, Woodford Green, Reino UnidoGreatBookPricesUK
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 204,80
Envío por EUR 17,52Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New.
- Tapa dura
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de AmericaGreatBookPrices
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Como Nuevo
EUR 224,25
Envío por EUR 2,26Se envía dentro de Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: As New. Unread book in perfect condition.
- Tapa dura
Librería: Ria Christie Collections, Uxbridge, Reino UnidoRia Christie Collections
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 223,93
Envío por EUR 13,99Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New. In.
- Tapa dura
Librería: Buchpark, Trebbin, AlemaniaBuchpark
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Excelente
EUR 131,75
Envío por EUR 105,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Condición: 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.
- Tapa dura
Librería: GreatBookPricesUK, Woodford Green, Reino UnidoGreatBookPricesUK
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Como Nuevo
EUR 229,35
Envío por EUR 17,52Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: As New. Unread book in perfect condition.
- Tapa dura
Librería: Rarewaves.com USA, London, LONDO, Reino UnidoRarewaves.com USA
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 268,34
Gastos de envío gratisSe envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Hardback. Condición: New. Illustrated. 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 grap…h 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.
- Tapa dura
Librería: Rarewaves.com UK, London, Reino UnidoRarewaves.com UK
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 255,93
Envío por EUR 75,90Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Hardback. Condición: New. Illustrated. 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 grap…h 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.
- Tapa dura
- Impresión bajo demanda
Librería: Brook Bookstore On Demand, Napoli, NA, ItaliaBrook Bookstore On Demand
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 190,64
Envío por EUR 5,50Se envía de Italia a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: new. Questo è un articolo print on demand.
- Tapa dura
- Impresión bajo demanda
Librería: PBShop.store UK, Fairford, GLOS, Reino UnidoPBShop.store UK
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 213,69
Envío por EUR 5,86Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 15 disponibles
HRD. Condición: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
- Tapa dura
- Impresión bajo demanda
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de AmericaGrand Eagle Retail
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 232,23
Gastos de envío gratisSe envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponibles
Hardcover. Condición: 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 multiple locations in the US or from the UK, depending on stock availability.
- Tapa dura
- Impresión bajo demanda
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 209,96
Envío por EUR 62,56Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Buch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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 d…esigning 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.
- Tapa dura
- Impresión bajo demanda
Librería: CitiRetail, Stevenage, Reino UnidoCitiRetail
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 238,73
Envío por EUR 43,21Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Hardcover. Condición: 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.
- Tapa dura
- Impresión bajo demanda
Librería: Books Puddle, New York, NY, Estados Unidos de AmericaBooks Puddle
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 288,66
Envío por EUR 3,42Se envía dentro de Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New. Print on Demand pp. 228.
- Tapa dura
- Impresión bajo demanda
Librería: preigu, Osnabrück, Alemaniapreigu
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 221,25
Envío por EUR 70,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 5 disponibles
Buch. Condición: Neu. Fast Parallel Algorithms for Graph Matching Problems | Marek Karpinski (u. a.) | Buch | Gebunden | Englisch | 1998 | OUP Oxford | EAN 9780198501626 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.
- Tapa dura
- Impresión bajo demanda
Librería: Majestic Books, Hounslow, Reino UnidoMajestic Books
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 304,73
Envío por EUR 7,59Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New. Print on Demand pp. 228 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.
- Tapa dura
- Impresión bajo demanda
Librería: Biblios, frankfurt am main, HESSE, AlemaniaBiblios
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 315,04
Envío por EUR 9,95Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New. PRINT ON DEMAND pp. 228.
