Distributed Louvain Algorithm for Graph Community Detection

In most real-world networks, the nodes/vertices tend to be organized into tightly-knit modules known as communities or clusters, such that nodes within a community are more likely to be "related" to one another than they are to the rest of the network. The goodness of partitioning into com...

Full description

Bibliographic Details

Published in:	2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS) pp. 885 - 895
Main Authors:	Ghosh, Sayan, Halappanavar, Mahantesh, Tumeo, Antonino, Kalyanaraman, Ananth, Lu, Hao, Chavarria-Miranda, Daniel, Khan, Arif, Gebremedhin, Assefaw
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.05.2018
Subjects:	Community detection Distributed graph clustering Heuristic algorithms Image edge detection Iterative methods Mathematical model Optimization Parallel algorithms Parallel graph heuristics Parallel Louvain Synchronization
ISSN:	1530-2075
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!