Toward Optimal Community Detection: From Trees to General Weighted Networks

DOI10.1080/15427951.2014.950875zbMath1461.68149OpenAlexW2047766788MaRDI QIDQ4985780

My T. Thai, Thang N. Dinh

Publication date: 26 April 2021

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15427951.2014.950875

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Applications of mathematical programming (90C90) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (6)

Concise integer linear programming formulation for clique partitioning problems ⋮ Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem ⋮ A study on modularity density maximization: column generation acceleration and computational complexity analysis ⋮ Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization ⋮ Efficient modularity density heuristics for large graphs ⋮ Redundant constraints in the standard formulation for the clique partitioning problem

Uses Software

• BotGraph

Cites Work

• Facets of the clique partitioning polytope
• Modularity-maximizing graph communities via mathematical programming
• A cutting plane algorithm for a clustering problem
• Cluster analysis and mathematical programming
• 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
• On Finding Graph Clusterings with Maximum Modularity
• An Efficient Heuristic Procedure for Partitioning Graphs
• Community structure in social and biological networks
• Fast unfolding of communities in large networks
• Collective dynamics of ‘small-world’ networks

This page was built for publication: Toward Optimal Community Detection: From Trees to General Weighted Networks