##########
References
##########

************
Architecture
************

2-D Data Partitioning

- Kang, S., Fender, A., Eaton, J., & Rees, B. (2020, September) *Computing PageRank Scores of Web Crawl Data Using DGX A100 Clusters*. In 2020 IEEE High Performance Extreme Computing Conference (HPEC) (pp. 1-4). IEEE.


| 

| 

**********
Algorithms
**********

Betweenness Centrality

- Brandes, U. (2001). *A faster algorithm for betweenness centrality*. Journal of mathematical sociology, 25(2), 163-177.
- Brandes, U. (2008). *On variants of shortest-path betweenness centrality and their generic computation*. Social Networks, 30(2), 136-145.
- McLaughlin, A., & Bader, D. A. (2018). *Accelerating GPU betweenness centrality*. Communications of the ACM, 61(8), 85-92.


Katz

- Katz, L. (1953). *A new status index derived from sociometric analysis*. Psychometrika, 18(1), 39-43.
- Foster, K.C., Muth, S.Q., Potterat, J.J. et al. *A faster Katz status score algorithm*. Computational & Mathematical Organization Theory (2001) 7: 275.



K-Truss

- J. Cohen, *Trusses: Cohesive subgraphs for social network analysis* National security agency technical report, 2008
- O. Green, J. Fox, E. Kim, F. Busato, et al. *Quickly Finding a Truss in a Haystack* IEEE High Performance Extreme Computing Conference (HPEC), 2017 https://doi.org/10.1109/HPEC.2017.8091038
- O. Green, P. Yalamanchili, L.M. Munguia, *Fast Triangle Counting on GPU* Irregular Applications: Architectures and Algorithms (IA3), 2014

Hungarian Algorithm

- Date, K., & Nagi, R. (2016). GPU-accelerated Hungarian algorithms for the Linear Assignment Problem. Parallel Computing, 57, 52-72.


Leiden

- Traag, V. A., Waltman, L., & Van Eck, N. J. (2019). *From Louvain to Leiden: guaranteeing well-connected communities*. Scientific reports, 9(1), 1-12.

Louvain

- VD Blondel, J-L Guillaume, R Lambiotte and E Lefebvre.  *Fast unfolding of community hierarchies in large networks*. J Stat Mech P10008 (2008)




| 

| 

*************
Other Papers
*************
- Hricik, T., Bader, D., & Green, O. (2020, September). *Using RAPIDS AI to Accelerate Graph Data Science Workflows*. In 2020 IEEE High Performance Extreme Computing Conference (HPEC) (pp. 1-4). IEEE.

| 

| 

**********
Data Sets
**********

karate
  - W. W. Zachary, *An information flow model for conflict and fission in small groups*, Journal of Anthropological Research 33, 452-473 (1977).
dolphins
  - D. Lusseau, K. Schneider, O. J. Boisseau, P. Haase, E. Slooten, and S. M. Dawson,
    *The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations*, 
    Behavioral Ecology and Sociobiology 54, 396-405 (2003).
netscience
  - M. E. J. Newman,
    *Finding community structure in networks using the eigenvectors of matrices*, 
    Preprint physics/0605087 (2006).
email-Eu-core
  - Hao Yin, Austin R. Benson, Jure Leskovec, and David F. Gleich.
    *Local Higher-order Graph Clustering.* 
    In Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2017.
  - J. Leskovec, J. Kleinberg and C. Faloutsos. 
    *Graph Evolution: Densification and Shrinking Diameters*. 
    ACM Transactions on Knowledge Discovery from Data (ACM TKDD), 1(1), 2007. http://www.cs.cmu.edu/~jure/pubs/powergrowth-tkdd.pdf 
polbooks
  - V. Krebs, unpublished, http://www.orgnet.com/.