Freunden von diesem Artikel berichten:
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)
Preis
€ 206,99
Bestellware
Lieferdatum: ca. 6. - 17. Dez
Weihnachtsgeschenke können bis zum 31. Januar umgetauscht werden
Zu deiner iMusic Wunschliste hinzufügen
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
| Medien | Bücher Gebundenes Buch (Buch mit hartem Rücken und steifem Einband) |
| Erscheinungsdatum | 26. März 1998 |
| ISBN13 | 9780198501626 |
| Verlag | Oxford University Press |
| Seitenanzahl | 224 |
| Maße | 161 × 242 × 17 mm · 463 g |