
Fortæl dine venner om denne vare:
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)
Pris
€ 219,49
Bestilles fra fjernlager
Forventes klar til forsendelse 30. jul. - 6. aug.
Tilføj til din iMusic ønskeseddel
Eller
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
Medie | Bøger Hardcover bog (Bog med hård ryg og stift omslag) |
Udgivet | 26. marts 1998 |
ISBN13 | 9780198501626 |
Forlag | Oxford University Press |
Antal sider | 224 |
Mål | 161 × 242 × 17 mm · 463 g |