Fast Parallel Algorithms for Graph Matching Problems: Combinatorial, Algebraic, and Probabilistic Approach - Oxford Lecture Series in Mathematics and Its Applications - Karpinski, Marek (Chair Professor of Computer Science, Chair Professor of Computer Science, University of Bonn, Germany) - Libros - Oxford University Press - 9780198501626 - 26 de marzo de 1998
En caso de que portada y título no coincidan, el título será el correcto

Fast Parallel Algorithms for Graph Matching Problems: Combinatorial, Algebraic, and Probabilistic Approach - Oxford Lecture Series in Mathematics and Its Applications

Karpinski, Marek (Chair Professor of Computer Science, Chair Professor of Computer Science, University of Bonn, Germany)

Precio
€ 200,99

Pedido desde almacén remoto

Entrega prevista 6 - 17 de dic.
Los regalos de Navidad se podrán canjear hasta el 31 de enero

Nuestros clientes opinan:

Política de devolución de 14 días conforme a la legislación europea de protección de los consumidores
Mejor valorado en Trustpilot
Añadir a tu lista de deseos de iMusic

Fast Parallel Algorithms for Graph Matching Problems: Combinatorial, Algebraic, and Probabilistic Approach - Oxford Lecture Series in Mathematics and Its Applications

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.

224 pages, line figures

Medios de comunicación Libros     Hardcover Book   (Libro con lomo y cubierta duros)
Publicado 26 de marzo de 1998
ISBN13 9780198501626
Editores Oxford University Press
Páginas 224
Dimensiones 161 × 242 × 17 mm   ·   463 g

Ver todo de Karpinski, Marek (Chair Professor of Computer Science, Chair Professor of Computer Science, University of Bonn, Germany) ( Ej. Hardcover Book )