R. H. Bisseling, Parallel Scientific Computation: A Structured Approach using BSP and MPI, 2004.
DOI : 10.1093/acprof:oso/9780198529392.001.0001

E. G. Boman, K. D. Devine, and S. Rajamanickam, Scalable matrix computations on large scale-free graphs using 2D graph partitioning Networking, Storage and Analysis Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication, Proc. International Conference on High Performance Computing, pp.1-50, 1999.

?. Patoh, ¨. U. , C. Aykanat, B. V. Uçar-]-¨-u, and C. Aykanat, On two-dimensional sparse matrix partitioning: Models, methods, and a recipe A fine-grain hypergraph model for 2D decomposition of sparse matrices A hypergraph-partitioning approach for coarse-grain decomposition, Proc. 15th IPDPS Proc. Supercomputing, pp.656-683, 2001.

D. Chakrabarti, Y. Zhan, and C. Faloutsos, R-MAT: A Recursive Model for Graph Mining, Proc. SDM, 2004.
DOI : 10.1137/1.9781611972740.43

T. A. Davis and Y. Hu, The university of Florida sparse matrix collection, ACM Transactions on Mathematical Software, vol.38, issue.1, pp.1-125, 2011.
DOI : 10.1145/2049662.2049663

A. L. Dulmage and N. S. Mendelsohn, Coverings of bipartite graphs, Journal canadien de math??matiques, vol.10, issue.0, pp.517-534, 1958.
DOI : 10.4153/CJM-1958-052-0

K. Kaya, B. Uçar, and U. V. , Analysis of Partitioning Models and Metrics in Parallel Sparse Matrix-Vector Multiplication, Proc. PPAM, pp.174-184, 2014.
DOI : 10.1007/978-3-642-55195-6_16
URL : https://hal.archives-ouvertes.fr/hal-00821523

V. Kuhlemann and P. S. Vassilevski, Improving the Communication Pattern in Matrix-Vector Operations for Large Scale-Free Graphs by Disaggregation, SIAM Journal on Scientific Computing, vol.35, issue.5, pp.465-486, 2013.
DOI : 10.1137/12088313X

J. Leskovec and R. Sosi?, SNAP, ACM Transactions on Intelligent Systems and Technology, vol.8, issue.1, 2014.
DOI : 10.1145/2898361

D. M. Pelt and R. H. Bisseling, A Medium-Grain Method for Fast 2D Bipartitioning of Sparse Matrices, 2014 IEEE 28th International Parallel and Distributed Processing Symposium, pp.529-539, 2014.
DOI : 10.1109/IPDPS.2014.62

A. Pothen and C. Fan, Computing the block triangular form of a sparse matrix, ACM Transactions on Mathematical Software, vol.16, issue.4, pp.303-324, 1990.
DOI : 10.1145/98267.98287

R. O. Selvitopi, M. Ozdal, and C. Aykanat, A Novel Method for Scaling Iterative Solvers: Avoiding Latency Overhead of Parallel Sparse-Matrix Vector Multiplies, IEEE Transactions on Parallel and Distributed Systems, vol.26, issue.3, pp.1-1, 2014.
DOI : 10.1109/TPDS.2014.2311804

B. Uçar and C. Aykanat, Revisiting Hypergraph Models for Sparse Matrix Partitioning, SIAM Review, vol.49, issue.4, pp.595-603, 2007.
DOI : 10.1137/060662459

B. Vastenhouw and R. H. Bisseling, A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication, SIAM Review, vol.47, issue.1, pp.67-95, 2005.
DOI : 10.1137/S0036144502409019

R. S. Xin, J. E. Gonzalez, M. J. Franklin, and I. Stoica, GraphX, First International Workshop on Graph Data Management Experiences and Systems, GRADES '13, pp.1-2, 2013.
DOI : 10.1145/2484425.2484427

A. Yoo, A. H. Baker, R. Pearce, and V. E. Henson, A scalable eigensolver for large scale-free graphs using 2D graph partitioning, Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis on, SC '11, pp.631-6311, 2011.
DOI : 10.1145/2063384.2063469

A. Yoo, E. Chow, K. Henderson, W. Mclendon, B. Hendrickson et al., A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L, ACM/IEEE SC 2005 Conference (SC'05), p.25, 2005.
DOI : 10.1109/SC.2005.4