Computing maximum matching in parallel on bipartite graphs: Worth the effort?

IAAA'11 - Proceedings of the 1st Workshop on Irregular Applications: Architectures and Algorithm, Co-located with SC'11

Volumn , Issue , 2011, Pages 11-14

  Azad, Ariful ^a   Halappanavar, Mahantesh ^b   Dobrian, Florin ^c   Pothen, Alex ^a  

^a PURDUE UNIVERSITY   (United States)

^b PACIFIC NORTHWEST NATIONAL LABORATORY   (United States)

^c Conviva Inc ^*  (United States)

Author keywords

graph algorithms; matching; multithreaded

Indexed keywords

AMD OPTERON; BIPARTITE GRAPHS; CARDINALITY MATCHING; DESIGN OF ALGORITHMS; GRAPH ALGORITHMS; INPUT GRAPHS; MATCHING; MATCHING ALGORITHM; MAXIMUM MATCHINGS; MULTITHREADED; MULTITHREADED ARCHITECTURE; PARALLEL IMPLEMENTATIONS; REAL-WORLD APPLICATION; TEST SETS;

COMPUTER ARCHITECTURE; IMAGE RETRIEVAL; MICROPROCESSOR CHIPS; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES;

GRAPH THEORY;

EID: 84856654315     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2089142.2089147     Document Type: Conference Paper

References (8)

1. I. S. Duff, K. Kaya, and B. Uçar. Design, implementation, and analysis of maximum transversal algorithms. ACM Transactions on Mathematical Software, 38(2), 2011.
2. I. S. Duff and J. Koster. On algorithms for permuting large entries to the diagonal of a sparse matrix. SIAM J. Matrix Anal. Appl., 22(4):973-996, 2000.
3. 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput., 2:225-231, 1973.
4. M. Karpinski and W. Rytter. Fast parallel algorithms for graph matching problems. Oxford University Press, Inc., New York, NY, USA, 1998.
5. L. Lovasz. Matching Theory (North-Holland mathematics studies). Elsevier Science Ltd, 1986.
6. F. Manne and R. H. Bisseling. A parallel approximation algorithm for the weighted maximum matching problem. In Proceedings of the 7th International Conference on Parallel Processing and Applied Mathematics, PPAM'07, pages 708-717. Springer-Verlag, 2008.
7. C. H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1982.
8. A. Pothen and C.-J. Fan. Computing the block triangular form of a sparse matrix. ACM Trans. Math. Softw., 16:303-324, December 1990.