Triangle counting for scale-free graphs at scale in distributed memory.
Roger PearcePublished in: HPEC (2017)
Keyphrases
- scale free
- distributed memory
- small world
- small world networks
- fully connected
- shared memory
- degree distribution
- complex networks
- power law
- ibm sp
- scale free networks
- parallel implementation
- protein protein interaction networks
- small world properties
- power law distribution
- parallel computers
- matrix multiplication
- clustering coefficient
- parallel machines
- social networks
- graph theory
- community structure
- preferential attachment
- graph theoretic
- graph mining
- real world networks
- random graphs
- undirected graph
- biological networks
- network structure
- graph cuts
- data management
- special case