Efficient modularity density heuristics for large graphs

DOI10.1016/j.ejor.2016.10.033zbMath1394.90578OpenAlexW2532115010MaRDI QIDQ1751717

Luís C. Lamb, Rafael de Santiago

Publication date: 25 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.10.033

zbMATH Keywords

heuristicsclusteringmodularity density maximizationlarge graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Multi-attribute community detection in international trade network ⋮ Modularity maximization to design contiguous policy zones for pandemic response ⋮ A study on modularity density maximization: column generation acceleration and computational complexity analysis ⋮ An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs ⋮ Two-mode modularity clustering of parts and activities for cell formation problems ⋮ Modified modularity density maximization and density ratio heuristic

Uses Software

• Pajek
• Pajek datasets
• SNAP
• VNDS
• LPAm+
• DIMACS
• bliss

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• MILP formulations for the modularity density maximization problem
• Community detection by modularity maximization using GRASP with path relinking
• Divisive heuristic for modularity density maximization
• Mixing local and global information for community detection in large networks
• Improving heuristics for network modularity maximization using an exact algorithm
• Reformulation of a model for hierarchical divisive graph modularity maximization
• Modularity-maximizing graph communities via mathematical programming
• Finding community structures in complex networks using mixed integer optimisation
• Redundant constraints in the standard formulation for the clique partitioning problem
• Detecting community structure: from parsimony to weighted parsimony
• Enhancing community detection using a network weighting strategy
• A hybrid artificial immune network for detecting communities in complex networks
• Spectral redemption in clustering sparse networks
• An Efficient Heuristic Procedure for Partitioning Graphs
• Adding cohesion constraints to models for modularity maximization in networks
• Toward Optimal Community Detection: From Trees to General Weighted Networks
• Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs
• Fast unfolding of communities in large networks
• Multilevel local search algorithms for modularity clustering
• Overlapping community detection in networks

This page was built for publication: Efficient modularity density heuristics for large graphs