Join thousands of book lovers
Sign up to our newsletter and receive discounts and inspiration for your next reading experience.
By signing up, you agree to our Privacy Policy.You can, at any time, unsubscribe from our newsletters.
Fast Parallel Algorithms for Graph Matching Problems
- Combinatorial, Algebraic, and Probabilistic Approach
- Binding:
- Hardback
- Pages:
- 224
- Published:
- March 25, 1998
- Dimensions:
- 161x242x17 mm.
- Weight:
- 463 g.
Delivery:
2-3 weeks
Expected delivery: January 12, 2025
About Marek (Chair Professor of Computer Science Karpinski
View all books by Marek (Chair Professor of Computer Science KarpinskiDescription of 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.
User ratings of Fast Parallel Algorithms for Graph Matching Problems
Rate this book
In order to rate this book you must be logged in.Others also bought..
Find similar books
The book Fast Parallel Algorithms for Graph Matching Problems can be found in the following categories:
You can, at any time, unsubscribe from our newsletters.
© 2024 Tales
All packages are shipped from our warehouse in the UK.
Company address: Esromgade 15, 3. - 2200 - DK
Registered company number: DK43351621
