Multilevel local search algorithms for modularity clustering

DOI10.1145/1963190.1970376zbMath1284.05309OpenAlexW2035479247MaRDI QIDQ5406246

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

multilevellocal searchrefinementmodularitygraph clustering

Mathematics Subject Classification ID

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

Related Items (9)

Traveling salesman problems with PageRank distance on complex networks reveal community structure ⋮ Fast Quasi-Threshold Editing ⋮ Exact computational solution of modularity density maximization by effective column generation ⋮ A constrained power method for community detection in complex networks ⋮ A DC Programming Approach for Finding Communities in Networks ⋮ Efficient modularity density heuristics for large graphs ⋮ Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering ⋮ Experiments on Density-Constrained Graph Clustering ⋮ Unnamed Item

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