Fast Parallel Algorithms for Graph Matching Problems (Oxford Lecture Series in Mathematics and Its Applications)

# Fast Parallel Algorithms for Graph Matching Problems (Oxford Lecture Series in Mathematics and Its Applications) best selction# Fast Parallel Algorithms for Graph Matching Problems (Oxford Lecture Series in Mathematics and Its Applications) You Here! Best Offers Today!



Product Description The matching problem is central to graph theory and the theory of algorithms. This book provides a comprehensive and straightforward introduction to the basic methods for designing efficient parallel algorithms for graph matching problems. Written for students at the beginning graduate level, the exposition is largely self-contained and example-driven; prerequisites have been kept to a minimum by including relevant background material. The book contains full details of several new techniques and will be of interest to researchers in computer science, operations research, discrete mathematics, and electrical engineering. The main theoretical tools are presented in three independent chapters, devoted to combinatorial tools, probabilistic tools, and algebraic tools. One of the goals of the book is to show how these three approaches can be combined to develop efficient parallel algorithms. The book represents a meeting point of interesting algorithmic techniques and opens up new algebraic and geometric areas....

Recent Product

Advanced Dynamics: Rigid Body, Multibody, and Aerospace Applic...
Inorganic and Organometallic Macromolecules: Design and Applic...
Aeroservoelastic Prediction: Predicting the Effects of Control...
Angewandte Grundwasserchemie, Hydrogeologie und hydrogeochemis...
ISO 6002:1992, Bolted bonnet steel gate valves
Computational Multiscale Modeling of Fluids and Solids: Theory...
Integrated Assessment of Sustainable Energy Systems in China: ...
Math in Our World
Nonvolitale Organic Memory Devices: Utilizing C60 Molecules an...