Fast parallel algorithm for unfolding of communities in large graphs
暂无分享,去创建一个
Viktor K. Prasanna | Charith Wickramaarachchi | Marc Frîncu | Patrick Small | Patrick E. Small | V. Prasanna | M. Frîncu | Charith Wickramaarachchi
[1] G. Amdhal,et al. Validity of the single processor approach to achieving large scale computing capabilities , 1967, AFIPS '67 (Spring).
[2] Réka Albert,et al. Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.
[3] Jennifer Widom,et al. GPS: a graph processing system , 2013, SSDBM.
[4] Padma Raghavan,et al. Scalable parallel graph partitioning , 2013, 2013 SC - International Conference for High Performance Computing, Networking, Storage and Analysis (SC).
[5] Santo Fortunato,et al. Community detection in graphs , 2009, ArXiv.
[6] S.,et al. An Efficient Heuristic Procedure for Partitioning Graphs , 2022 .
[7] Enhong Chen,et al. Kineograph: taking the pulse of a fast-changing and connected world , 2012, EuroSys '12.
[8] Jure Leskovec,et al. Defining and Evaluating Network Communities Based on Ground-Truth , 2012, ICDM.
[9] David A. Bader,et al. Scalable Multi-threaded Community Detection in Social Networks , 2012, 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum.
[10] M E J Newman,et al. Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.
[11] Sanjukta Bhowmick,et al. A Template for Parallelizing the Louvain Method for Modularity Maximization , 2013 .
[12] Vipin Kumar,et al. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..
[13] Christian Staudt,et al. Engineering High-Performance Community Detection Heuristics for Massive Graphs , 2013, 2013 42nd International Conference on Parallel Processing.
[14] Jean-Loup Guillaume,et al. Fast unfolding of communities in large networks , 2008, 0803.0476.
[15] Srinivasan Parthasarathy,et al. An event-based framework for characterizing the evolutionary behavior of interaction graphs , 2007, KDD '07.
[16] Vipin Kumar,et al. Parallel multilevel graph partitioning , 1996, Proceedings of International Conference on Parallel Processing.
[17] Yogesh L. Simmhan,et al. GoFFish: A Sub-graph Centric Framework for Large-Scale Graph Analytics , 2013, Euro-Par.
[18] Alex Pothen,et al. Graph Partitioning Algorithms with Applications to Scientific Computing , 1997 .