Most of the real-world networks exhibit community structure, a property that reveals the existence of natural vertex clusters whose inter-edge density is lower than intra-edge density between various groups. Despite providing a better understanding of network structure and characteristics, community detection has many practical applications in diverse domains. Communities obtained from the telephone network provides many useful information that can be used for churn prediction, budget control in organizations etc. Detecting communities is a fundamental need in the area of networks, yet challenging. In this paper, we propose an extension to the Girvan-Newman algorithm for finding the betweenness using the transitive closure property and the greedy technique in Dijkstra's single source shortest path method.
R. G. Gayathri, Jyothisha J. Nair, and Kaimal, M. R., “Extending Full Transitive Closure to Rank Removable Edges in GN Algorithm ”, Proceedings of the 6th International Conference on Advances in Computing and Communications, vol. 93. pp. 995–1002, 2016.