SKU/Artículo: AMZ-0198501625
Fast Parallel Algorithms for Graph Matching Problems (Oxford Lecture Series in Mathematics and Its Applications)
Format:
Hardcover
Detalles del producto
Disponibilidad:
En stock
En stock
Peso con empaque:
0.45 kg
0.45 kg
Devolución:
No
No
Condición
Nuevo
Nuevo
Producto de:
Amazon
Amazon
Viaja desde
USA
USA
Sobre este producto
- 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, discrete mathematics, 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 parallel algorithms. The book represents a meeting point of interesting algorithmic techniques and opens up new algebraic and geometric areas.
AR$519.921
31% OFF
AR$358.570
IMPORT EASILY
By purchasing this product you can deduct VAT with your RUT number
AR$519.921
31% OFF
AR$358.570
Pagá fácil y rápido con Mercado Pago o MODO
Llega en 18 a 28 días hábiles
con envío
Tienes garantía de entrega
Este producto viaja
de USA ![]()
a tus manos en
![]()
a tus manos en
Compra protegida
Disfruta de una experiencia de compra segura y confiable
Tarjetas de Crédito y Débito
Visa
Mastercard
American Express
Pagos a través de PayPal
Compra procesada en dólares con dinero en cuenta o tarjetas internacionales.
Paypal
Pagos a través de MODO
Compra procesada en pesos desde la App de tu banco.
PayPal
