
Vinkkaa tuotetta kavereillesi:
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)
Hinta
HK$ 1.767,70
Tilattu etävarastosta
Arvioitu toimitus ke 30. heinä - pe 8. elo
Lisää iMusic-toivelistallesi
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
Media | Kirjat Hardcover Book (Sidottu kirja kovilla kansilla sekä suojakannella) |
Julkaisupäivämäärä | torstai 26. maaliskuuta 1998 |
ISBN13 | 9780198501626 |
Tuottaja | Oxford University Press |
Sivujen määrä | 224 |
Mitta | 161 × 242 × 17 mm · 463 g |