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) - Bøker - Oxford University Press - 9780198501626 - 26. mars 1998
Ved uoverensstemmelse mellom cover og tittel gjelder tittel

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
R$ 1.199,90

Bestillingsvarer

Forventes levert 31. jul - 11. aug

Kundene våre sier:

14 dages returrett
Toppvurdering på Trustpilot
Legg til iMusic ønskeliste
Eller

Fast Parallel Algorithms for Graph Matching Problems: Combinatorial, Algebraic, and Probabilistic Approach - Oxford Lecture Series in Mathematics and Its Applications

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 Bøker     Innbunden bok   (Bok med hard rygg og stivt omslag)
Utgitt 26. mars 1998
ISBN13 9780198501626
Utgivere Oxford University Press
Antall sider 224
Mål 161 × 242 × 17 mm   ·   463 g

Se alt med Karpinski, Marek (Chair Professor of Computer Science, Chair Professor of Computer Science, University of Bonn, Germany) ( f.eks. Innbunden bok )