Parallel Graph Partitioning for Complex Networks

Processing large complex networks like social networks or web graphs has attracted considerable interest. To do this in parallel, we need to partition them into pieces of roughly equal size. Unfortunately, previous parallel graph partitioners originally developed for more regular mesh-like networks...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on parallel and distributed systems Vol. 28; no. 9; pp. 2625 - 2638
Main Authors:	Meyerhenke, Henning, Sanders, Peter, Schulz, Christian
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.09.2017 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	algorithm design and analysis Clustering Clustering algorithms Clusters Coarsening combinatorial algorithms Complex networks Evolutionary algorithms Evolutionary computation graph algorithms Graph theory Load balancing and task assignment Multilevel Parallel processing Partitioning Partitioning algorithms Partitions Propagation Social network services Social networks Sociology Statistics Structural hierarchy
ISSN:	1045-9219, 1558-2183
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!