Source: wikibot/girvan-newman-algorithm
= Girvan–Newman algorithm
{wiki=Girvan–Newman_algorithm}
The Girvan-Newman algorithm is a method used in network theory for detecting communities within a graph. It was developed by Michelle Girvan and Mark Newman in 2002. The algorithm identifies and extracts the community structure of a network by progressively removing edges based on the concept of edge betweenness, which measures the number of shortest paths that pass through an edge.