A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks
From MaRDI portal
Publication:498452
DOI10.1007/s10878-013-9665-1zbMath1332.90325MaRDI QIDQ498452
My T. Thai, Thang N. Dinh, Nam-phuong Nguyen, Md. Abdul Alim
Publication date: 28 September 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-013-9665-1
90C35: Programming involving graphs or networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Correlation clustering
- Modularity-maximizing graph communities via mathematical programming
- Relaxing the uniformity and independence assumptions using the concept of fractal dimension
- Evolution of the social network of scientific collaborations
- On the complexity of Newman's community finding approach for biological and social networks
- A Social Network Based Patching Scheme for Worm Containment in Cellular Networks
- A random graph model for massive graphs
- On Finding Graph Clusterings with Maximum Modularity
- The Structure and Function of Complex Networks
- Fast unfolding of communities in large networks