Skip to search formSkip to main contentSkip to account menu

Girvan–Newman algorithm

Known as: Girvan-Newman algorithm, Newman-Girvan algorithm 
The Girvan–Newman algorithm (named after Michelle Girvan and Mark Newman) is a hierarchical method used to detect communities in complex systems.
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Abstract: One of the common approaches for the community detection in complex networks is the Girvan-Newman algorithm [5] which… 
2016
2016
Multi-layer networks are networks on a set of entities (nodes) with multiple types of relations (edges) among them where each… 
2015
2015
We consider a schema for graph-theoretic clustering of data using a node-based resilience measure called vertex attack tolerance… 
2010
2010
  • Peng Li
  • 2010
  • Corpus ID: 11275493
The automatic search and community discovery in large and complex network has important practical application. It is difficult to… 
2010
2010
El siguiente articulo analiza el impacto de una estrategia pedagogica que se nutre de las propuestas del aprendizaje cooperativo… 
2010
2010
Introduction 1. Boyhood 2. Oxford 3. Early Fathers 4. Conversion 5. Father Faber 6.Infallibility 7. Apologia 8. Gladstone 9. Old… 
2010
2010
To improve the efficiency of Girvan-Newman(G-N) algorithm, a community detection algorithm named modularity extreme approximation… 
2004
2004
Distance education utilizing online courses has emerged as an area of program development for many teacher education programs…