Fast Parallel Algorithms for Graph Matching Problems
- Combinatorial, Algebraic, and Probabilistic Approach
- Indbinding:
- Hardback
- Sideantal:
- 224
- Udgivet:
- 26. marts 1998
- Størrelse:
- 161x242x17 mm.
- Vægt:
- 463 g.
Leveringstid:
2-3 uger
Forventet levering: 2. december 2024
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
Giv din bedømmelse
For at bedømme denne bog, skal du være logget ind.Andre købte også..
Find lignende bøger
Bogen Fast Parallel Algorithms for Graph Matching Problems findes i følgende kategorier:
© 2024 Pling BØGER Registered company number: DK43351621