| Fast Parallel Algorithms for Graph Matching Problems Contributor(s): Karpinski, Marek (Author), Rytter, Wojciech (Author) |
|
 |
ISBN: 0198501625 ISBN-13: 9780198501626 Publisher: Clarendon Press OUR PRICE: $171.00 Product Type: Hardcover Published: May 1998 Annotation: 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. |
| Additional Information |
| BISAC Categories: - Mathematics | Graphic Methods - Computers | Computer Science - Mathematics | Discrete Mathematics |
| Dewey: 511.5 |
| LCCN: 98176128 |
| Series: Oxford Lecture Series in Mathematics and Its Applications |
| Physical Information: 0.56" H x 6.14" W x 9.21" (1.10 lbs) 224 pages |
| Descriptions, Reviews, Etc. |
| Publisher 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. |