High-Quality Shared-Memory Graph Partitioning

Partitioning graphs into blocks of roughly equal size such that few edges run between blocks is a frequently needed operation in processing graphs. Recently, size, variety, and structural complexity of these networks has grown dramatically. Unfortunately, previous approaches to parallel graph partit...

Full description

Bibliographic Details

Published in:	IEEE transactions on parallel and distributed systems Vol. 31; no. 11; pp. 2710 - 2722
Main Authors:	Akhremtsev, Yaroslav, Sanders, Peter, Schulz, Christian
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.11.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Balance criterion Clustering algorithms Complex networks Contracts Graphs label propagation local search Parallel algorithms Parallel graph partitioning Partitioning Partitioning algorithms Program processors shared-memory parallelism
ISSN:	1045-9219, 1558-2183
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!