A study of graph partitioning schemes for parallel graph community detection-Reference-Cited by-同舟云学术

A study of graph partitioning schemes for parallel graph community detection

Published:2016-10 Issue: Volume:58 Page:131-139
ISSN:0167-8191
Container-title:Parallel Computing
language:en
Short-container-title:Parallel Computing

Author:

Zeng Jianping,Yu Hongfeng

Funder

U.S. Department of Energy

National Science Foundation

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference20 articles.

1. On the representation and multiplication of hypersparse matrices;Buluç,2008

2. Parallel modularity-based community detection on large-scale graphs;Zeng,2015

3. Finding and evaluating community structure in networks;Newman;Phys. Rev. E,2004

4. Finding community structure in very large networks;Clauset;Phys. Rev. E,2004

5. Fast unfolding of communities in large networks;Blondel;J. Stat. Mech.,2008

Cited by 20 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Exploring community detection methods and their diverse applications in complex networks: a comprehensive review;Social Network Analysis and Mining;2024-06-12

2. Community Detection at scale;Proceedings of the 26th Pan-Hellenic Conference on Informatics;2022-11-25

3. The evolving network model with community size and distance preferences;Physica A: Statistical Mechanics and its Applications;2022-06

4. Fission: Practical algorithms for computing minimum balanced node separators;Discrete Mathematics, Algorithms and Applications;2022-01-22

5. An Improved Louvain Algorithm for Community Detection;Mathematical Problems in Engineering;2021-11-23