Abstract

Graph partitioning is a fundamental problem in several scientific and engineering applications. In this paper, we describe heuristics that improve the state-of-the-art practical algorithms used in graph-partitioning software in terms of both partitioning speed and quality. An important use of graph-partitioning is in ordering sparse matrices for obtaining direct solutions to sparse systems of linear equations arising in engineering and optimization applications. The experiments reported in this paper show that the use of these heuristics results in a considerable improvement in the quality of sparse-matrix orderings over conventional ordering methods, especially for sparse matrices arising in linear programming problems. In addition, our graph-partitioning-based ordering algorithm is more parallelizable than minimum-degree-based ordering algorithms, and it renders the ordered matrix more amenable to parallel factorization.

Citations

864	An Efficient Heuristic Procedure for Partitioning Graphs - Kernighan, Lin - 1970
616	A fast and high quality multilevel scheme for partitioning irregular graphs - Karypis, Kumar - 1999
445	Introduction to Parallel Computing: Design and Analysis of Algorithms - Grama, Karypis, et al. - 2003
428	Computer Solution of Large Sparse Positive Definite Systems - George, Liu - 1981
376	Multilevel k-way partitioning scheme for irregular graphs - Karypis, Kumar - 1998
367	A multi-level algorithm for partitioning graphs - Hendrickson, Leland - 1995
338	A separator theorem for planar graphs - Lipton, Tarjan - 1979
268	Mattheyses, “A Linear Time Heuristic for Improving Network Partitions”, DAC - Fiduccia, M - 1982
202	A column approximate minimum degree ordering algorithm - Davis, Gilbert, et al.
156	Computing the minimum fill-in is NP-complete - Yannakakis - 1981
150	Generalized nested dissection - LIPTON, ROSE, et al. - 1979
107	The evolution of minimum degree ordering algorithm - George, Liu - 1989
100	Highly scalable parallel algorithms for sparse matrix factorization - Gupta, Karypis, et al. - 1993
99	MeTiS unstructured graph partitioning and sparse matrix ordering system version 2.0 - Karypis, Kumar - 1995
78	Analysis of multilevel graph partitioning - Karypis, Kumar - 1995
60	A heuristic for reducing fill in sparse matrix factorization - Bui, Jones - 1993
57	Computing the block triangular form of a sparse matrix - POTHEN, FAN - 1990
44	Robust ordering of sparse matrices using multisection - Ashcraft, JWH - 1995
43	Improving the runtime and quality of nested dissection ordering - Hendrickson, Rothberg - 1998
41	Compressed graphs and the minimum degree algorithm - Ashcraft - 1995
38	Massively parallel methods for engineering and science problems - Camp, Plimpton, et al. - 1994
23	Nested dissection of a regular finite-element mesh - George - 1973
16	A parallel formulation of interior point algorithms - Karypis, Gupta, et al. - 1994
15	Sparse matrix ordering methods for interior point linear programming - Rothberg, Hendrickson - 1996
15	Communication reduction in parallel sparse Cholesky factorization on a hypercube - George, Liu, et al. - 1987
11	Generalized nested dissection: some recent progress - Ashcraft, Liu - 1994
10	WGPP: Watson graph partitioning (and sparse matrix ordering) package: Users manual - Gupta - 1996
8	Graph partitioning based sparse matrix ordering algorithms for interior-point methods - Gupta - 1996
8	Parallel algorithms for forward and back substitution in direct solution of sparse linear systems - Gupta, Kumar - 1995
4	A parallel implementation of the multiple minimum degree ordering heuristic - Rothberg - 1994
4	Remarks on implementations of O(n 1/2 #) assignment algorithms - Duff, Wiberg - 1988