Tell your friends about this 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)
Price
HK$ 1,789
excl. VAT
Ordered from remote warehouse
Expected to be ready for shipping Aug 19 - 31
Get notified about new Karpinski, Marek (Chair Professor of Computer Science, Chair Professor of Computer Science, University of Bonn, Germany) releases
Add to your iMusic wish list
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 | Books Hardcover Book (Book with hard spine and cover) |
| Released | May 28, 1998 |
| ISBN13 | 9780198501626 |
| Publishers | Oxford University Press |
| Pages | 224 |
| Dimensions | 161 × 242 × 17 mm · 498 g |
| Language | English |