WA: University of Milano Laboratory of Web Algorithms. Datasets.
WOVSYD: S. Williams, L. Oliker, R. Vuduc, J. Shalf, K. Yelick, and J. Demmel. Optimization of sparse matrix-vector multiplication on emerging multicore platforms. Parallel Computing, 35(3):178 – 194, 2009. Revolutionary Technologies for Acceleration of Emerging Petascale Applications.
DIMACS10: David A. Bader, Andrea Kappes, Henning Meyerhenke, Peter Sanders, Christian Schulz and Dorothea Wagner. Benchmarking for Graph Clustering and Partitioning. In Encyclopedia of Social Network Analysis and Mining, pages 73-82. Springer, 2014.
DAC2012: Natarajan Viswanathan, Charles J. Alpert, Cliff C. N. Sze, Zhuo Li, Yaoguang Wei, "The DAC 2012 Routability-driven Placement Contest and Benchmark Suite", In Proc. Design Automation Conference, pp. 774-782, 2012.
SMC: Timothy A. Davis and Yifan Hu. 2011. The University of Florida Sparse Matrix Collection. ACM Transactions on Mathematical Software 38, 1, Article 1 (December 2011), 25 pages. DOI: https://doi.org/10.1145/2049662.2049663
SNAP: J. Leskovec. Stanford Network Analysis Package (SNAP).
WSVR: F. Khorasani, R. Gupta, and L. N. Bhuyan. Scalable SIMD-Efficient Graph Processing on GPUs, 39 - 50, 2014. Proceedings of the 24th International Conference on Parallel Architectures and Compilation Techniques
KAGEN: D. Funke, S. Lamm, P. Sanders, C. Schulz, D. Strash, and M. von Looz. Communication-free massively distributed graph generation. In IEEE International Parallel and Distributed Processing Symposium, IPDPS, 2018.