We design, implement, and evaluate GPU-based algorithms for the maximum cardinality matching problem in bipartite graphs. Such algorithms have a variety of applications in computer science, scientific computing, bioinformatics, and other areas. To the best of our knowledge, ours is the first study which focuses on the GPU implementation of the maximum cardinality matching algorithms. We compare the proposed algorithms with serial and multicore implementations from the literature on a large set of real-life problems where in majority of the cases one of our GPU-accelerated algorithms is demonstrated to be faster than both the sequential and multicore implementations. © 2013 Springer-Verlag.
CITATION STYLE
Deveci, M., Kaya, K., Uçar, B., & Çatalyürek, Ü. V. (2013). GPU accelerated maximum cardinality matching algorithms for bipartite graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8097 LNCS, pp. 850–861). https://doi.org/10.1007/978-3-642-40047-6_84
Mendeley helps you to discover research relevant for your work.