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öcker - Oxford University Press - 9780198501626 - 26 mars 1998
Om omslag och titel inte matchar är det titeln som gäller

Karpinski, Marek (Chair Professor of Computer Science, Chair Professor of Computer Science, University of Bonn, Germany)
Fast Parallel Algorithms for Graph Matching Problems: Combinatorial, Algebraic, and Probabilistic Approach - Oxford Lecture Series in Mathematics and Its Applications

Pris
SEK 2.129

Beställningsvara

Förväntad leverans 5 - 14 jan 2026
Julklappar kan bytas fram till 31:e januari

Våra kunder säger:

14 dagars returrätt
Toppbetyg på Trustpilot
Lägg till din iMusic-önskelista
eller

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öcker     Inbunden Bok   (Inbunden bok med hårda pärmar och skyddsomslag)
Releasedatum 26 mars 1998
ISBN13 9780198501626
Utgivare Oxford University Press
Antal sidor 224
Mått 161 × 242 × 17 mm   ·   463 g
Språk Engelska  

Se alt med Karpinski, Marek (Chair Professor of Computer Science, Chair Professor of Computer Science, University of Bonn, Germany) ( t.ex. Inbunden Bok )