Engineering Parallel Algorithms for Community Detection in Massive Networks

The amount of graph-structured data has recently experienced an enormous growth in many applications. To transform such data into useful information, fast analytics algorithms and software tools are necessary. One common graph analytics kernel is disjoint community detection (or graph clustering). D...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on parallel and distributed systems Vol. 27; no. 1; pp. 171 - 184
Main Authors:	Staudt, Christian L., Meyerhenke, Henning
Format:	Journal Article
Language:	English
Published:	IEEE 01.01.2016
Subjects:	Algorithm design and analysis Clustering algorithms Communities Disjoint community detection graph clustering Image edge detection Instruction sets network analysis parallel algorithm engineering parallel Louvain method Parallel processing Software algorithms network analysis Disjoint community detection parallel Louvain method parallel algorithm engineering graph clustering
ISSN:	1045-9219
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!