The analysis of algorithms
Constructing a perfect matching is in random NC
Combinatorica
A Las Vegas RNC algorithm for maximum matching
Combinatorica
Matching is as easy as matrix inversion
Combinatorica
A new parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
An introduction to parallel algorithms
An introduction to parallel algorithms
Approximating matchings in parallel
Information Processing Letters
Fast parallel algorithms for graph matching problems
Fast parallel algorithms for graph matching problems
Parallel approximation algorithms for maximum weighted matching in general graphs
Information Processing Letters
A linear-time approximation algorithm for weighted matchings in graphs
ACM Transactions on Algorithms (TALG)
Improved distributed approximate matching
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Local, distributed weighted matching on general and wireless topologies
Proceedings of the fifth international workshop on Foundations of mobile computing
Bipartite Graph Matching Computation on GPU
EMMCVPR '09 Proceedings of the 7th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition
Maximum weighted matching using the partitioned global address space model
SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
A simple parallel approximation algorithm for maximum weight matching
Proceedings of the Third Conference on Partitioned Global Address Space Programing Models
Distributed fractional packing and maximum weighted b-matching via tail-recursive duality
DISC'09 Proceedings of the 23rd international conference on Distributed computing
| Hi-index | 0.89 |
We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 - ε), This improves the previously best approximation ratio of (1/2 - ε) of an NC algorithm for this problem.