Revision as of 21:25, 14 March 2009 edit 121.120.100.151 (talk) →Edge betweenness and community structure ← Previous edit		Revision as of 16:15, 2 April 2009 edit undo 121.120.11.220 (talk) →Edge betweenness and community structure Next edit →
Line 19: The end result of the Girvan-Newman algorithm is a [[dendrogram]]. As the Girvan-Newman algorithm runs, the dendrogram is produced from the top down (ie. the network splits up into different communities with the successive removal of links). The leaves of the dendrogram are individual nodes. ~~The last discussion in this algorithm was in April 9,2009 in UKM Malaysia by Abdulgabbar Al-Sharabi~~ == See also ==

Girvan–Newman algorithm: Difference between revisions