A study of graph partitioning schemes for parallel graph community detection

Zeng, Jianping; Yu, Hongfeng

doi:10.1016/j.parco.2016.05.008

Title: A study of graph partitioning schemes for parallel graph community detection

Authors:: Zeng, Jianping; Yu, Hongfeng

Publication Date:: Sat Oct 01 00:00:00 EDT 2016

Sponsoring Org.:: USDOE

OSTI Identifier:: 1397978

Resource Type:: Publisher's Accepted Manuscript

Journal Name:: Parallel Computing

Additional Journal Information:: Journal Name: Parallel Computing Journal Volume: 58 Journal Issue: C; Journal ID: ISSN 0167-8191

Publisher:: Elsevier

Country of Publication:: Netherlands

Language:: English

Citation Formats


                    Zeng, Jianping, and Yu, Hongfeng. A study of graph partitioning schemes for parallel graph community detection.  Netherlands: N. p., 2016. 
Web.  doi:10.1016/j.parco.2016.05.008.

Copy to clipboard


                    Zeng, Jianping, & Yu, Hongfeng. A study of graph partitioning schemes for parallel graph community detection.  Netherlands.  https://doi.org/10.1016/j.parco.2016.05.008

Copy to clipboard


                    Zeng, Jianping, and Yu, Hongfeng. Sat .  
"A study of graph partitioning schemes for parallel graph community detection".  Netherlands.  https://doi.org/10.1016/j.parco.2016.05.008.

Copy to clipboard


                    
@article{osti_1397978,

  title        = {A study of graph partitioning schemes for parallel graph community detection},

  author       = {Zeng, Jianping and Yu, Hongfeng},

  abstractNote = {},

  doi          = {10.1016/j.parco.2016.05.008},

  journal      = {Parallel Computing},

  number       = C,

  volume       = 58,

  place        = {Netherlands},

  year         = {Sat Oct 01 00:00:00 EDT 2016},

  month        = {Sat Oct 01 00:00:00 EDT 2016}

}

Copy to clipboard

Journal Article:

Free Publicly Available Full Text

Accepted Manuscript (Publisher)

Publisher's Version of Record
https://doi.org/10.1016/j.parco.2016.05.008

Other availability

Search WorldCat to find libraries that may hold this journal

Citation Metrics:

Cited by: 17 works

Citation information provided by
Web of Science

Save / Share:

Export Metadata

Save to My Library

Works referenced in this record:

Finding community structure in very large networks
journal, December 2004

Clauset, Aaron; Newman, M. E. J.; Moore, Cristopher
Physical Review E, Vol. 70, Issue 6
DOI: 10.1103/PhysRevE.70.066111

Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities
journal, July 2009

Lancichinetti, Andrea; Fortunato, Santo
Physical Review E, Vol. 80, Issue 1
DOI: 10.1103/PhysRevE.80.016118

Community detection in graphs
journal, February 2010

Fortunato, Santo
Physics Reports, Vol. 486, Issue 3-5
DOI: 10.1016/j.physrep.2009.11.002

Finding and evaluating community structure in networks
journal, February 2004

Newman, M. E. J.; Girvan, M.
Physical Review E, Vol. 69, Issue 2
DOI: 10.1103/PhysRevE.69.026113

Parallel heuristics for scalable community detection
journal, August 2015

Lu, Hao; Halappanavar, Mahantesh; Kalyanaraman, Ananth
Parallel Computing, Vol. 47
DOI: 10.1016/j.parco.2015.03.003

Overlapping community detection in networks: The state-of-the-art and comparative study
journal, August 2013

Xie, Jierui; Kelley, Stephen; Szymanski, Boleslaw K.
ACM Computing Surveys, Vol. 45, Issue 4
DOI: 10.1145/2501654.2501657

Similar Records in DOE PAGES and OSTI.GOV collections:

Fast parallel algorithms for graph-theoretic problems: matching, coloring, and partitioning

Thesis/Dissertation Karloff, H J

New parallel algorithms are presented to solve graph-theoretic problems of three kinds: matching, coloring, and partitioning. Throughout, superfast algorithms, are sought, those running on a parallel random access machine in time polynomial in the log of the input size (polylog time) and using a polynomial number of processors. Problems solvable with such algorithms are said to be in NC. Those solvable by randomized algorithms obeying the same time and processor bounds are said to be in RNC or LVNC; those in RNC (or Monte Carlo RNC) are solvable by algorithms which, on instances of size n, return a correct answermore »« less
Graph Partitioning Models for Parallel Computing

Journal Article Hendrickson, B ; Kolda, T G - Parallel Computing

Calculations can naturally be described as graphs in which vertices represent computation and edges reflect data dependencies. By partitioning the vertices of a graph, the calculation can be divided among processors of a parallel computer. However, the standard methodology for graph partitioning minimizes the wrong metric and lacks expressibility. We survey several recently proposed alternatives and discuss their relative merits.
Full Text Available
An improved spectral graph partitioning algorithm for mapping parallel computations

Technical Report Hendrickson, B ; Leland, R

Efficient use of a distributed memory parallel computer requires that the computational load be balanced across processors in a way that minimizes interprocessor communication. We present a new domain mapping algorithm that extends recent work in which ideas from spectral graph theory have been applied to this problem. Our generalization of spectral graph bisection involves a novel use of multiple eigenvectors to allow for division of a computation into four or eight parts at each stage of a recursive decomposition. The resulting method is suitable for scientific computations like irregular finite elements or differences performed on hypercube or mesh architecturemore »« less
Sparse Matrix Partitioning for Parallel Eigenanalysis of Large Static and Dynamic Graphs.

Conference Wolf, Michael ; Miller, Ben

Abstract not provided.
https://doi.org/10.1109/HPEC.2014.7040955

Full Text Available
Task-based Parallel Computation of the Density Matrix in Quantum-based Molecular Dynamics using Graph Partitioning

Journal Article Ghale, Purnima ; Kroonblawd, Matthew P. ; Mniszewski, Sue ; ... - SIAM Journal on Scientific Computing

Quantum-based molecular dynamics (QMD) is a highly accurate and transferable method for material science simulations. However, the time scales and system sizes accessible to QMD are typically limited to picoseconds and a few hundred atoms. These constraints arise due to expensive self-consistent ground-state electronic structure calculations that can often scale cubically with the number of atoms. Linearly scaling methods depend on computing the density matrix P from the Hamiltonian matrix H by exploiting the sparsity in both matrices. The second-order spectral projection (SP2) algorithm is an O(N) algorithm that computes P with a sequence of 40 - 50 matrix-matrix multiplications.more »« less
Cited by 4
https://doi.org/10.1137/16M109404X

Full Text Available

Similar Records

Title: A study of graph partitioning schemes for parallel graph community detection

Citation Formats

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

Community detection in graphs journal, February 2010

Finding and evaluating community structure in networks journal, February 2004

Parallel heuristics for scalable community detection journal, August 2015

Overlapping community detection in networks: The state-of-the-art and comparative study journal, August 2013

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

Community detection in graphs
journal, February 2010

Finding and evaluating community structure in networks
journal, February 2004

Parallel heuristics for scalable community detection
journal, August 2015

Overlapping community detection in networks: The state-of-the-art and comparative study
journal, August 2013