• Sign In / Register
  • Help
  • Basket0
Fast Parallel Algorithms for Graph Matching Problems: Combinatorial, Algebraic, and Probabilistic Approach - Oxford Lecture Series in Mathematics and Its Applications 9 (Hardback)
  • Fast Parallel Algorithms for Graph Matching Problems: Combinatorial, Algebraic, and Probabilistic Approach - Oxford Lecture Series in Mathematics and Its Applications 9 (Hardback)
zoom

Fast Parallel Algorithms for Graph Matching Problems: Combinatorial, Algebraic, and Probabilistic Approach - Oxford Lecture Series in Mathematics and Its Applications 9 (Hardback)

(author), (author)
£102.50
Hardback 224 Pages / Published: 26/03/1998
  • We can order this

Usually despatched within 3 weeks

  • This item has been added to your basket
The matching problem is one of the central problems in graph theory as well as in the theory of algorithms and their applications. This book will provide the reader with a comprehensive and straightforward introduction to the basic methods of designing efficient parallel algorithms for graph matching problems. The text is written for students at the beginning graduate level. The exposition is mostly 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 should also be of interest to research workers in computer science, operations research, discrete mathematics, and electrical engineering. The main theoretical tools are combined into three independent chapters, devoted to combinatorial tools, probabilistic tools, and algebraic tools. One of the main goals of the book is to bring together these three approaches and highlight how their combination works in the development of efficient parallel algorithms. The reader will be provided with a simple and transparent presentation of a variety of interesting algorithms, including many examples and illustrations. The combination of different approaches makes the matching problem and its applications an attractive and fascinating subject. It is hoped that the book represents a meeting point of interesting algorithmic techniques and opens up new algebraic and geometric areas. Marek Karpinski is Chair Professor of Computer Science at the University of Bonn. Wojciech Rytter is Professor of Computer Science at the University of Warsaw and at the University of Liverpool.

Publisher: Oxford University Press
ISBN: 9780198501626
Number of pages: 224
Weight: 463 g
Dimensions: 242 x 161 x 17 mm

You may also be interested in...

Doing Bayesian Data Analysis
Added to basket
Complex Adaptive Systems
Added to basket
Probability and Random Processes
Added to basket
Networks: A Very Short Introduction
Added to basket
Advanced Engineering Mathematics
Added to basket
Pharmaceutical Calculations Workbook
Added to basket
Mathematical Techniques
Added to basket
How to Gamble If You Must
Added to basket
X and the City
Added to basket
£14.99
Paperback
Chaos: A Very Short Introduction
Added to basket
Linear Algebra
Added to basket
£29.99
Paperback

Reviews

Please sign in to write a review

Your review has been submitted successfully.