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) - Boeken - Oxford University Press - 9780198501626 - 26 maart 1998
Indien omslag en titel niet overeenkomen, is de titel correct

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)

Prijs
€ 204,99

Besteld in een afgelegen magazijn

Verwachte levering 6 - 17 dec.
Kerstcadeautjes kunnen tot en met 31 januari worden ingewisseld

Onze klanten zeggen:

14 dagen retourrecht in overeenstemming met de Europese consumentenbeschermingswetgeving
Topnotering op Trustpilot
Voeg toe aan uw iMusic-verlanglijst

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 Boeken     Hardcover Book   (Boek met harde rug en kaft)
Vrijgegeven 26 maart 1998
ISBN13 9780198501626
Uitgevers Oxford University Press
Pagina's 224
Afmetingen 161 × 242 × 17 mm   ·   463 g

Bekijk alles van Karpinski, Marek (Chair Professor of Computer Science, Chair Professor of Computer Science, University of Bonn, Germany) ( bijv. Hardcover Book )