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øger - Oxford University Press - 9780198501626 - 26. marts 1998
Ved uoverensstemmelse mellem cover og titel gælder titel

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
₺ 10.320

Bestilles fra fjernlager

Forventes klar til forsendelse 31. jul. - 7. aug.

Vores kunder siger:

14 dages fuld returret
Topvurdering på Trustpilot
Tilføj til din iMusic ønskeseddel
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

Medie Bøger     Hardcover bog   (Bog med hård ryg og stift omslag)
Udgivet 26. marts 1998
ISBN13 9780198501626
Forlag Oxford University Press
Antal 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. Hardcover bog )