Conte aos seus amigos sobre este item:
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
R$ 1.254,90
excluindo impostos
Item sob encomenda (no estoque do fornecedor)
Espera-se estar pronto para envio 12 - 19 de jan de 2026
Presentes de Natal podem ser trocados até 31 de janeiro
O que dizem nossos clientes:
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
Karpinski, Marek (Chair Professor of Computer Science, Chair Professor of Computer Science, University of Bonn, Germany)
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 |
| Idioma | Inglês |