K-truss decomposition for Scale-Free Graphs at Scale in Distributed Memory.
Roger PearceGeoffrey SandersPublished in: HPEC (2018)
Keyphrases
- scale free
- distributed memory
- small world
- small world networks
- fully connected
- degree distribution
- shared memory
- power law
- protein protein interaction networks
- complex networks
- scale free networks
- parallel implementation
- ibm sp
- small world properties
- matrix multiplication
- parallel computers
- preferential attachment
- community structure
- power law distribution
- biological networks
- clustering coefficient
- parallel computing
- graph theoretic
- parallel processing
- message passing
- graph theory
- real world networks
- pairwise
- random graphs
- graph mining
- parallel machines