Efficient modularity density heuristics for large graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2084315 (Why is no real title available?)
- scientific article; zbMATH DE number 6180551 (Why is no real title available?)
- A hybrid artificial immune network for detecting communities in complex networks
- Adding cohesion constraints to models for modularity maximization in networks
- An Efficient Heuristic Procedure for Partitioning Graphs
- An ensemble learning strategy for graph clustering
- Community detection by modularity maximization using GRASP with path relinking
- Detecting community structure: from parsimony to weighted parsimony
- Divisive heuristic for modularity density maximization
- Engineering an efficient canonical labeling tool for large and sparse graphs
- Enhancing community detection using a network weighting strategy
- Fast unfolding of communities in large networks
- Finding community structures in complex networks using mixed integer optimisation
- Improving heuristics for network modularity maximization using an exact algorithm
- MILP formulations for the modularity density maximization problem
- Mixing local and global information for community detection in large networks
- Modularity-maximizing graph communities via mathematical programming
- Multilevel local search algorithms for modularity clustering
- Overlapping community detection in networks
- Redundant constraints in the standard formulation for the clique partitioning problem
- Reformulation of a model for hierarchical divisive graph modularity maximization
- Spectral redemption in clustering sparse networks
- Toward optimal community detection: from trees to general weighted networks
Cited in
(8)- Improving heuristics for network modularity maximization using an exact algorithm
- An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs
- Multi-attribute community detection in international trade network
- Correcting for granularity bias in modularity-based community detection methods
- Modified modularity density maximization and density ratio heuristic
- Two-mode modularity clustering of parts and activities for cell formation problems
- Modularity maximization to design contiguous policy zones for pandemic response
- A study on modularity density maximization: column generation acceleration and computational complexity analysis
This page was built for publication: Efficient modularity density heuristics for large graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1751717)
