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) - Books - Oxford University Press - 9780198501626 - May 28, 1998
In case cover and title do not match, the title is correct

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

Price
Íkr 28,279
excl. VAT

Ordered from remote warehouse

Expected delivery Aug 13 - 27
Get notified about new Karpinski, Marek (Chair Professor of Computer Science, Chair Professor of Computer Science, University of Bonn, Germany) releases

Our customers say:

14-day return policy in accordance with European consumer protection law
Top ranking on Trustpilot
Add to your iMusic wish list

Not rated yet

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 Books     Hardcover Book   (Book with hard spine and cover)
Released May 28, 1998
ISBN13 9780198501626
Publishers Oxford University Press
Pages 224
Dimensions 161 × 242 × 17 mm   ·   498 g
Language English  

More from the same publisher

See all of Karpinski, Marek (Chair Professor of Computer Science, Chair Professor of Computer Science, University of Bonn, Germany) ( e.g. Hardcover Book )