Approximate weighted matching on emerging manycore and multithreaded architectures

Abstract

Graph matching is a prototypical combinatorial problem with many applications in high performance scientific computing. Optimal algorithms for computing matchings are challenging to parallelize. Approximation algorithms are amenable to parallelization and are therefore important to compute matchings for large scale problems. Approximation algorithms also… (More)
DOI: 10.1177/1094342012452893

Topics

8 Figures and Tables

Statistics

051015201520162017
Citations per Year

Citation Velocity: 5

Averaging 5 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@article{Halappanavar2012ApproximateWM, title={Approximate weighted matching on emerging manycore and multithreaded architectures}, author={Mahantesh Halappanavar and John Feo and Oreste Villa and Antonino Tumeo and Ajit Joe Pothen}, journal={IJHPCA}, year={2012}, volume={26}, pages={413-430} }