Author:
Fagginger Auer Bas O.,Bisseling Rob H.
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Aykanat, C., Pinar, A., Çatalyürek, U.V.: Permuting sparse rectangular matrices into block-diagonal form. SIAM J. Sci. Comput. 25(6), 1860–1879 (2004)
2. Bader, D.A., Sanders, P., Wagner, D., Meyerhenke, H., Hendrickson, B., Johnson, D.S., Walshaw, C., Mattson, T.G.: 10th DIMACS implementation challenge - graph partitioning and graph clustering (2012),
http://www.cc.gatech.edu/dimacs10/index.shtml
3. Bell, N., Garland, M.: Cusp: Generic parallel algorithms for sparse matrix and graph computations, version 0.1.0 (2010),
http://cusp-library.googlecode.com
4. Bertsekas, D.P.: A distributed asynchronous relaxation algorithm for the assignment problem. In: 24th IEEE CDC, vol. 24, pp. 1703–1704 (1985)
5. Çatalyürek, U.V., Aykanat, C.: Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication. IEEE Trans. Par. Dist. Syst. 10(7), 673–693 (1999)
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. GPU-based butterfly counting;The VLDB Journal;2024-06-27
2. Parallel Maximum Cardinality Matching for General Graphs on GPUs;2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW);2024-05-27
3. Unbalanced Optimal Transport: A Unified Framework for Object Detection;2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR);2023-06
4. Self-organizing maps and full GPU parallel approach to graph matching;Computer Communications;2023-01
5. Highly Parallel Linear Forest Extraction from a Weighted Graph on GPUs;Proceedings of the 51st International Conference on Parallel Processing;2022-08-29