An auction-based weighted matching implementation on massively parallel architectures
Authors:
- 1 December 2012
- journal article
- research article
- Published by Elsevier in Parallel Computing
- Vol. 38 (12) , 595-614
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Towards auction algorithms for large dense assignment problemsComputational Optimization and Applications, 2007
- THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITIONInternational Journal of Pattern Recognition and Artificial Intelligence, 2004
- Parallel Scientific Computation2004
- Linear Time Local Improvements for Weighted Matchings in GraphsLecture Notes in Computer Science, 2003
- On Algorithms For Permuting Large Entries to the Diagonal of a Sparse MatrixSIAM Journal on Matrix Analysis and Applications, 2001
- Preconditioning Highly Indefinite and Nonsymmetric MatricesSIAM Journal on Scientific Computing, 2000
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse MatricesSIAM Journal on Matrix Analysis and Applications, 1999
- An optimal algorithm for approximate nearest neighbor searching fixed dimensionsJournal of the ACM, 1998
- Reverse auction algorithms for assignment problems1993
- A survey of heuristics for the weighted matching problemNetworks, 1983