Main image
Click to view image in fullscreen
![]()
Fast Parallel Algorithms for Graph Matching Problems
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.
1 550,00 DH
Sur commande
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.
| ISBN / EAN | 9780198501626 |
|---|---|
| Auteur | Karpinski, Marek (Chair Professor of Computer Science, Chair Professor of Computer Science, University of Bonn) |
| Editeur | Oxford University Press |