A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection

DOI10.1007/978-3-540-78808-9_11zbMath1142.68453arXiv0707.2387OpenAlexW1589566040MaRDI QIDQ3520035

Hristo N. Djidjev

Publication date: 19 August 2008

Published in: Algorithms and Models for the Web-Graph (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0707.2387

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

Social network community detection using agglomerative spectral clustering ⋮ Improving heuristics for network modularity maximization using an exact algorithm ⋮ A DC Programming Approach for Finding Communities in Networks ⋮ Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization ⋮ Using Mathematical Programming to Refine Heuristic Solutions for Network Clustering

This page was built for publication: A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection