Efficient Tracking of Communities on Evolving Graphs with Leiden Algorithm
Author:
Open Access
- 13 July 2026
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 498-508
Abstract
No abstract availableThis publication has 25 references indexed in Scilit:
- Leiden-Fusion Partitioning Method for Effective Distributed Training of Graph Embeddings2024
- Attack scenario reconstruction via fusing heterogeneous threat intelligenceComputers & Security, 2023
- Regional retail landscapes emerging from spatial network analysisRegional Studies, 2022
- From Louvain to Leiden: guaranteeing well-connected communitiesScientific Reports, 2019
- Parallel heuristics for scalable community detectionParallel Computing, 2015
- Finding overlapping communities in networks by label propagationNew Journal of Physics, 2010
- Fast unfolding of communities in large networksJournal of Statistical Mechanics: Theory and Experiment, 2008
- Resolution limit in community detectionProceedings of the National Academy of Sciences, 2007
- Modularity from fluctuations in random graphs and complex networksPhysical Review E, 2004
- MJRTY—A Fast Majority Vote Algorithm1991