Using graph partitioning for efficient network modularity optimization
From MaRDI portal
communities of a networkMetis graph partitioning toolminimum weighted cut problemmodularity optimization problem
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Recommendations
- A cutting plane algorithm for modularity maximization problem
- A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection
- Modularity-maximizing graph communities via mathematical programming
- Multilevel local optimization of modularity
- scientific article; zbMATH DE number 6180551
Cited in
(10)- Multilevel local optimization of modularity
- Theoretical aspects of equitable partition of networks into sparse modules
- A Statistical Performance Analysis of Graph Clustering Algorithms
- Partition network into communities based on group action on sets
- Network Flow-Based Refinement for Multilevel Hypergraph Partitioning
- Optimizing edge sets in networks to produce ground truth communities based on modularity
- A method based on total variation for network modularity optimization using the MBO scheme
- Attributed Networks Partitioning Based on Modularity Optimization
- Partitioning a PPI network into overlapping modules constrained by high-density and periphery tracking
- The optimal partitioning of networks
This page was built for publication: Using graph partitioning for efficient network modularity optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5298936)
