Exploring temporal community evolution: algorithmic approaches and parallel optimization for dynamic community detection

Dynamic (temporal) graphs are a convenient mathematical abstraction for many practical complex systems including social contacts, business transactions, and computer communications. Community discovery is an extensively used graph analysis kernel with rich literature for static graphs. However, comm...

Full description

Saved in:
Bibliographic Details
Published in:Applied network science 2023-12, Vol.8 (1), p.64-29, Article 64
Main Authors: Sattar, Naw Safrin, Buluc, Aydin, Ibrahim, Khaled Z., Arifuzzaman, Shaikh
Format: Article
Language:English
Subjects:
Algorithms
Community detection
Community evolution
Complex systems
Complexity
Computer Appl. in Social and Behavioral Sciences
Computer Science
Dynamic network
Graphs
Modularity
Optimization
Parallel algorithm
Permanence
Run time (computers)
Simulation and Modeling
Special Issue of the 11th International Conference on Complex Networks and their Applications
Temporal network
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!