Multilevel local search algorithms for modularity clustering

DOI10.1145/1963190.1970376MaRDI QIDQ5406246zbMATH OpenOpenAlexFDO

Authors Randolf Rotta, Andreas Noack

Publication date 1 April 2014

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1963190.1970376

zbMATH Keywords

graph clusteringlocal searchmodularitymultilevelrefinement

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection
• On Finding Graph Clusterings with Maximum Modularity
• scientific article; zbMATH DE number 6180551
• Multilevel local optimization of modularity
• Modularity-maximizing graph communities via mathematical programming

Cited in

(16)

• Traveling salesman problems with PageRank distance on complex networks reveal community structure
• Exact computational solution of modularity density maximization by effective column generation
• Large neighborhood search applied to the software module clustering problem
• A constrained power method for community detection in complex networks
• Efficient modularity density heuristics for large graphs
• A locally optimal hierarchical divisive heuristic for bipartite modularity maximization
• Multilevel local optimization of modularity
• Fast quasi-threshold editing
• Assessing the quality of multilevel graph clustering
• Multilevel graph embedding
• Aggregative coarsening for multilevel hypergraph partitioning
• Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering
• Graph coarsening and clustering on the GPU
• A DC Programming Approach for Finding Communities in Networks
• Pasco (parallel structured coarsening): an overlay to speed up graph clustering algorithms
• Fast unfolding of communities in large networks: 15 years later

This page was built for publication: Multilevel local search algorithms for modularity clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5406246)