Multilevelk-way Partitioning Scheme for Irregular Graphs

In this paper, we present and study a class of graph partitioning algorithms that reduces the size of the graph by collapsing vertices and edges, we find ak-way partitioning of the smaller graph, and then we uncoarsen and refine it to construct ak-way partitioning for the original graph. These algor...

Full description

Bibliographic Details

Published in:	Journal of parallel and distributed computing Vol. 48; no. 1; pp. 96 - 129
Main Authors:	Karypis, George, Kumar, Vipin
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 10.01.1998
Subjects:	graph partitioning Kernighan–Lin heuristic multilevel partitioning methods parallel sparse matrix algorithms spectral partitioning methods spectral partitioning methods parallel sparse matrix algorithms graph partitioning multilevel partitioning methods Kernighan–Lin heuristic
ISSN:	0743-7315, 1096-0848
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!