C. Ashcraft and J. W. Liu, Applications of the Dulmage-Mendelsohn decomposition and 645 network flow to graph bisection improvement, SIAM Journal on Matrix Analysis and Ap646 plications, vol.19, pp.325-354, 1998.

E. G. Boman, K. D. Devine, and S. Rajamanickam, Scalable matrix computations on large 648 scale-free graphs using 2d graph partitioning, Proceedings of the International Conference 649 on High Performance Computing, Networking, Storage and Analysis, SC '13, vol.50, p.12, 2013.

U. and C. Aykanat, Hypergraph-partitioning-based decomposition for parallel 652 sparse-matrix vector multiplication, Parallel and Distributed Systems, IEEE Transactions, vol.653, pp.673-693, 1999.

U. and C. Aykanat, A fine-grain hypergraph model for 2d decomposition of 655 sparse matrices, Parallel and Distributed Processing Symposium, International, vol.3, pp.656-30118, 2001.

U. and C. Aykanat, A hypergraph-partitioning approach for coarse-grain decom658 position, Supercomputing, ACM/IEEE 2001 Conference, pp.42-42, 2001.

U. and C. Aykanat, Patoh (partitioning tool for hypergraphs, Encyclopedia 660 of Parallel Computing, pp.1479-1487, 2011.

U. , C. Aykanat, and B. Uçar, On two-dimensional sparse matrix partitioning, p.662
URL : https://hal.archives-ouvertes.fr/ensl-00536961

M. Models, SIAM Journal on Scientific Computing, vol.32, pp.656-663, 2010.

U. V. , C. Aykanat, and B. Uçar, On two-dimensional sparse matrix partition665 ing: Models, methods, and a recipe, SIAM J. Sci. Comput, vol.32, pp.656-683, 2010.

T. A. Davis and Y. Hu, The University of Florida sparse matrix collection, ACM Trans. Math. 667 Softw, vol.38, 2011.

E. D. Dolan and J. J. Moré, Benchmarking optimization software with performance profiles, 669 Mathematical programming, vol.91, pp.201-213, 2002.

K. Kaya, B. Uçar, and U. V. , Analysis of partitioning models and metrics in 671 parallel sparse matrix-vector multiplication, Parallel Processing and Applied Mathemat672 ics (PPAM2014), p.673

, Lecture Notes in Computer Science, vol.674, pp.174-184, 2014.

E. Kayaaslan, B. Uçar, and C. Aykanat, Semi-two-dimensional partitioning for parallel 676 sparse matrix-vector multiplication, Parallel and Distributed Processing Symposium 677 Workshop (IPDPSW), pp.1125-1134, 2015.

D. Konig, GráfokGráfokés mátrixok. matematikaí es fizikai lapok, vol.38, p.679, 1931.

V. Kuhlemann and P. S. Vassilevski, Improving the communication pattern in matrix-vector 680 operations for large scale-free graphs by disaggregation, SIAM Journal on Scientific Com681 puting, vol.35, pp.465-486, 2013.

D. M. Pelt and R. H. Bisseling, A medium-grain method for fast 2d bipartitioning of sparse 683 matrices, Parallel and Distributed Processing Symposium, pp.529-539, 2014.

B. Uçar and C. Aykanat, Revisiting hypergraph models for sparse matrix partitioning, SIAM 686 review, vol.49, pp.595-603, 2007.

B. Vastenhouw and R. H. Bisseling, A two-dimensional data distribution method for parallel 688 sparse matrix-vector multiplication, SIAM Review, vol.47, pp.67-95, 2005.

R. S. Xin, J. E. Gonzalez, M. J. Franklin, and I. Stoica, Graphx: A resilient distributed 690 graph system on spark, First International Workshop on Graph Data Management Ex691 periences and Systems, GRADES '13, vol.2, pp.1-2, 2013.

A. Yoo, A. H. Baker, R. Pearce, and V. E. Henson, A scalable eigensolver for large 693 scale-free graphs using 2D graph partitioning, Proc. International Conference for High 694 Performance Computing, Networking, Storage and Analysis, vol.63, 2011.

A. Yoo, E. Chow, K. Henderson, W. Mclendon, B. Hendrickson et al., 696 A scalable distributed parallel breadth-first search algorithm on bluegene/l, Proceedings 697 of the 2005 ACM/IEEE Conference on Supercomputing, SC '05, p.25, 2005.