Girvan-newman Algorithm
The Girvan–Newman Algorithm is a hierarchical community detection method that iteratively removes edges with the highest betweenness to uncover the modular structure of complex networks.
170
Publications
27.8K
Citations
476
Authors
237
Institutions
Publications per year
2017–2026
56
Variants
Girvan–newman Method
Parents
170
Santo Fortunato · Physics Reports · 2009 · 11.3K citations · Full text
Community detection algorithms: A comparative analysis
Andrea Lancichinetti, Santo Fortunato · Physical Review E · 2009 · 2.2K citations · Full text
Statistical mechanics of community detection
Stefan Bornholdt · Physical Review E · 2006 · 2.1K citations · Full text
1–5 of 170
476
6
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 476
237

Chinese Academy of Sciences
Beijing, China
6 h-index
17 publications
1K citations
Institute for Scientific Interchange
Turin, Italy
5 h-index
8 publications
16.1K citations
École Polytechnique
Palaiseau, France
5 h-index
7 publications
2.7K citations

Huazhong University of Science and Technology
Wuhan, China
4 h-index
14 publications
754 citations

Universitat Rovira i Virgili
Tarragona, Spain
4 h-index
9 publications
555 citations
Academy of Mathematics and Systems Science
Beijing, China
4 h-index
13 publications
850 citations
Dalian University of Technology
Dalian, China
3 h-index
7 publications
358 citations

Xidian University
Xi'an, China
3 h-index
12 publications
348 citations
1–8 of 237
30 publications · 1.5K citations
19
h-index
PRE · 11 publications · 5.3K citations
11
h-index
7 publications · 371 citations
7
h-index
4 publications · 152 citations
4
h-index
4 publications · 294 citations
4
h-index
1–5