A study of graph partitioning schemes for parallel graph community detection
Journal Article
·
· Parallel Computing
Not Available
- Sponsoring Organization:
- USDOE
- OSTI ID:
- 1397978
- Journal Information:
- Parallel Computing, Journal Name: Parallel Computing Journal Issue: C Vol. 58; ISSN 0167-8191
- Publisher:
- ElsevierCopyright Statement
- Country of Publication:
- Netherlands
- Language:
- English
Parallel heuristics for scalable community detection
|
journal | August 2015 |
Community detection in graphs
|
journal | February 2010 |
Finding and evaluating community structure in networks
|
journal | February 2004 |
Finding community structure in very large networks
|
journal | December 2004 |
Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities
|
journal | July 2009 |
Overlapping community detection in networks: The state-of-the-art and comparative study
|
journal | August 2013 |
Similar Records
Graph Partitioning Models for Parallel Computing
Dynamic graphs, community detection, and Riemannian geometry
Parallel heuristics for scalable community detection
Journal Article
·
Mon Mar 01 23:00:00 EST 1999
· Parallel Computing
·
OSTI ID:4179
Dynamic graphs, community detection, and Riemannian geometry
Journal Article
·
Wed Mar 28 20:00:00 EDT 2018
· Applied Network Science
·
OSTI ID:1432088
Parallel heuristics for scalable community detection
Journal Article
·
Fri Jul 31 20:00:00 EDT 2015
· Parallel Computing
·
OSTI ID:1198720