A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
SIAM Journal on Matrix Analysis and Applications
On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix
SIAM Journal on Matrix Analysis and Applications
Parallel Scientific Computation: A Structured Approach Using BSP and MPI
Parallel Scientific Computation: A Structured Approach Using BSP and MPI
A simpler linear time 2/3 - ε approximation for maximum weight matching
Information Processing Letters
A linear-time approximation algorithm for weighted matchings in graphs
ACM Transactions on Algorithms (TALG)
Linear time 1/2 -approximation algorithm for maximum weighted matching in general graphs
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Maximum weighted matching using the partitioned global address space model
SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
A parallel preconditioning strategy for efficient transistor-level circuit simulation
Proceedings of the 2009 International Conference on Computer-Aided Design
A simple parallel approximation algorithm for maximum weight matching
Proceedings of the Third Conference on Partitioned Global Address Space Programing Models
Parallel greedy graph matching using an edge partitioning approach
Proceedings of the fourth international workshop on High-level parallel programming and applications
Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization
SIAM Journal on Scientific Computing
Computing maximum matching in parallel on bipartite graphs: worth the effort?
Proceedings of the first workshop on Irregular applications: architectures and algorithm
A GPU algorithm for greedy graph matching
Facing the Multicore-Challenge II
Parallel community detection for massive graphs
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I
Engineering graph partitioning algorithms
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
A multithreaded algorithm for network alignment via approximate matching
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Approximate weighted matching on emerging manycore and multithreaded architectures
International Journal of High Performance Computing Applications
Efficient parallel and external matching
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
| Hi-index | 0.00 |
We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial scientific computing. Since an exact algorithm for the weighted matching problem is both fairly expensive to compute and hard to parallelise we instead consider fast approximation algorithms. We analyse a distributed algorithm due to Hoepman [8] and show how this can be turned into a parallel algorithm. Through experiments using both complete as well as sparse graphs we show that our new parallel algorithm scales well using up to 32 processors.