1. KONECT (the koblenz network collection). konect.cc/networks/
2. Ahmed, A., Shervashidze, N., Narayanamurthy, S.M., Josifov, V.A., Smola, J.: Distributed large-scale natural graph factorization. In: Proceedings of WWW’13
3. Auroux, L., Burelle, M., Erra, R.: Reordering very large graphs for fun and profit. In: International Symposium on Web AlGorithms (2015)
4. Balaji, V., Lucia, B.: When is graph reordering an optimization? studying the effect of lightweight graph reordering across applications and input graphs. In: Proceedings of IEEE IISWC’18
5. Behrisch, M., Bach, B., Riche, T. S., Fekete, J.: Matrix reordering methods for table and network visualization. Comput. Graph. Forum, 35(3) (2016)