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) - Livros - Oxford University Press - 9780198501626 - 26 de março de 1998
Caso a capa e o título não sejam correspondentes, considere o título como correto

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)

Preço
€ 210,99

Item sob encomenda (no estoque do fornecedor)

Data prevista de entrega 5 - 14 de mar

O que dizem nossos clientes:

Política de devolução de 14 dias, em conformidade com a lei europeia de proteção do consumidor
Melhor classificação na Trustpilot
Adicione à sua lista de desejos do 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

Mídia Livros     Hardcover Book   (Livro com lombada e capa dura)
Lançado 26 de março de 1998
ISBN13 9780198501626
Editoras Oxford University Press
Páginas 224
Dimensões 161 × 242 × 17 mm   ·   463 g

Ver tudo de Karpinski, Marek (Chair Professor of Computer Science, Chair Professor of Computer Science, University of Bonn, Germany) ( por exemplo Hardcover Book )