1. The Top500 Supercomputer Sites. http://www.top500.org
2. The Graph500 Benchmark (2012). http://www.graph500.org
3. Bader, D.A., Meyerhenke, H., Sanders, P., Wagner, D. (eds.): Graph Partitioning and Graph Clustering -10th DIMACS Implementation Challenge Workshop, Georgia Institute of Technology, Atlanta, GA, USA, 13–14 February 2012, Proceedings, Contemporary Mathematics (2013). http://dblp.uni-trier.de/db/conf/dimacs/dimacs2012.html
4. Beamer, S., Asanović, K., Patterson, D.: Direction-optimizing breadth-first search. In: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, SC 2012, Los Alamitos, CA, USA, pp. 12:1–12:10 (2012). http://dl.acm.org/citation.cfm?id=2388996.2389013
5. Checconi, F., Petrini, F.: Traversing trillions of edges in real-time: graph exploration on large-scale parallel machines. In: IEEE 28th International Symposium on Parallel Distributed Processing (IPDPS). IEEE (2014)