Black November: Store besparelser hele måneden Vi fejrer Black Friday hele november måned med store besparelser
Udvidet returret til d. 31. januar 2025
Hjælp
Login
  1. Forside
  2. Bøger
  3. Business og læring
  4. Fast Parallel Algorithms for Graph Matching Problems

Fast Parallel Algorithms for Graph Matching Problems

- Combinatorial, Algebraic, and Probabilistic Approach

af Marek (Chair Professor of Computer Science Karpinski

indgår i Oxford Lecture Series in Mathematics and Its Applications serien

Fast Parallel Algorithms for Graph Matching Problems af Marek (Chair Professor of Computer Science Karpinski
Bag om Fast Parallel Algorithms for Graph Matching Problems

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.

Vis mere
  • Sprog:
  • Engelsk
  • ISBN:
  • 9780198501626
  • Indbinding:
  • Hardback
  • Sideantal:
  • 224
  • Udgivet:
  • 26. marts 1998
  • Størrelse:
  • 161x242x17 mm.
  • Vægt:
  • 463 g.
  • BLACK NOVEMBER
  Gratis fragt
Leveringstid: 2-3 uger
Forventet levering: 6. december 2024

Bag om Marek (Chair Professor of Computer Science Karpinski

Vis alle bøger af Marek (Chair Professor of Computer Science Karpinski

Beskrivelse af Fast Parallel Algorithms for Graph Matching Problems

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.

Brugerbedømmelser af Fast Parallel Algorithms for Graph Matching Problems



Andre købte også..
Find lignende bøger
Bogen Fast Parallel Algorithms for Graph Matching Problems findes i følgende kategorier:

Gør som tusindvis af andre bogelskere

Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.