## A fast and high quality multilevel scheme for partitioning irregular graphs (1998)

### Cached

### Download Links

by
George Karypis
,
Vipin Kumar

Venue: | SIAM JOURNAL ON SCIENTIFIC COMPUTING |

Citations: | 794 - 12 self |

### BibTeX

@ARTICLE{Karypis98afast,

author = {George Karypis and Vipin Kumar},

title = {A fast and high quality multilevel scheme for partitioning irregular graphs},

journal = {SIAM JOURNAL ON SCIENTIFIC COMPUTING},

year = {1998},

volume = {20},

number = {1},

pages = {359--392}

}

### Years of Citing Articles

### OpenURL

### Abstract

Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partition for the original graph [Bui and Jones, Proc.