Fast Parallel Algorithms for Graph Matching Problems (Hardcover)

Idioma: inglés

Editorial: Oxford University Press, Oxford, 1998

0198501625 / 9780198501626

Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de AmericaGrand Eagle Retail

Vendedor de 5 estrellas

Vendedor de IberLibro desde 12 de octubre de 2005

Tapa dura

Condición: Nuevo

EUR 242,23

 Gastos de envío gratis 
Se envía dentro de Estados Unidos de America

Cantidad disponible: 1 disponible

Añadir al carrito
Devoluciones gratuitas de 30 días

Descripción del artículo del vendedor

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

N° de ref. del artículo 9780198501626

Título
Fast Parallel Algorithms for Graph Matching Problems (Hardcover)
Autor
Marek Karpinski
Editorial
Oxford University Press, Oxford
Año de publicación
1998
Estado
new
Encuadernación
Hardcover
Idioma
inglés
ISBN 10
0198501625
ISBN 13
9780198501626

Grand Eagle Retail

Bensenville, IL, Estados Unidos de America

Vendedor de 5 estrellas

Vendedor de IberLibro desde 12 de octubre de 2005

Tarifas de envío en Estados Unidos de America

ArtículoDe 6 a 14 días hábilesDe 6 a 16 días hábiles
Primer artículoEUR 0,00EUR 0,00
Los plazos de entrega los establecen los vendedores y varían según el transportista y la ubicación. Los pedidos que pasan por la aduana pueden sufrir retrasos y los compradores son responsables de los aranceles o tarifas asociadas. Los vendedores pueden ponerse en contacto con usted en relación con cargos adicionales para cubrir cualquier aumento en los costes de envío de los artículos.

Métodos de pago

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

Información empresarial del vendedor

APOLLO ONLINE CORP.

605 Geddes Street
Wilmington, DE Estados Unidos de America 19805