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...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of parallel and distributed computing Ročník 48; číslo 1; s. 96 - 129
Hlavní autori:	Karypis, George, Kumar, Vipin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 10.01.1998
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!