## Graph Partitioning Algorithms With Applications To Scientific Computing (1997)

Venue: | Parallel Numerical Algorithms |

Citations: | 39 - 0 self |

### BibTeX

@INPROCEEDINGS{Pothen97graphpartitioning,

author = {Alex Pothen},

title = {Graph Partitioning Algorithms With Applications To Scientific Computing},

booktitle = {Parallel Numerical Algorithms},

year = {1997},

pages = {323--368},

publisher = {Kluwer Academic Press}

}

### OpenURL

### Abstract

Identifying the parallelism in a problem by partitioning its data and tasks among the processors of a parallel computer is a fundamental issue in parallel computing. This problem can be modeled as a graph partitioning problem in which the vertices of a graph are divided into a specified number of subsets such that few edges join two vertices in different subsets. Several new graph partitioning algorithms have been developed in the past few years, and we survey some of this activity. We describe the terminology associated with graph partitioning, the complexity of computing good separators, and graphs that have good separators. We then discuss early algorithms for graph partitioning, followed by three new algorithms based on geometric, algebraic, and multilevel ideas. The algebraic algorithm relies on an eigenvector of a Laplacian matrix associated with the graph to compute the partition. The algebraic algorithm is justified by formulating graph partitioning as a quadratic assignment p...