Andere Kunden interessierten sich auch für
![Evolutionary Algorithms in Theory and Practice]( "Evolutionary Algorithms in Theory and Practice")
Evolutionary Algorithms in Theory and Practice347,99 €![Embeddability in Graphs]( "Embeddability in Graphs")
Embeddability in Graphs77,99 €![Graph Algorithms and Applications 1]( "Graph Algorithms and Applications 1")
Graph Algorithms and Applications 1159,99 €![Embeddability in Graphs]( "Embeddability in Graphs")
Embeddability in Graphs117,99 €![Introduction to Parallel Computing]( "Introduction to Parallel Computing")
Introduction to Parallel Computing270,99 €![Nonlinear Dimensionality Reduction]( "Nonlinear Dimensionality Reduction")
Nonlinear Dimensionality Reduction103,99 €![Nonlinear Dimensionality Reduction]( "Nonlinear Dimensionality Reduction")
Nonlinear Dimensionality Reduction168,99 €
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.
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.
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.