Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

ICPP

1995

IEEE

1995

IEEE

– In this paper we present experiments with 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. We investigate the effectiveness of many different choices for all three phases: coarsening, partition of the coarsest graph, and reﬁnement. In particular, we present a new coarsening heuristic (called heavy-edge heuristic) for which the size of the partition of the coarse graph is within a small factor of the size of the ﬁnal partition obtained after multilevel reﬁnement. We also present a new scheme for reﬁning during uncoarsening that is much faster than the Kernighan-Lin reﬁnement. We test our scheme on a large number of graphs arising in various domains including ﬁnite element methods, linear programming, VLSI, and transportation. Our experiments show that our scheme consistently produces partitions that are better tha...

Related Content

Added |
26 Aug 2010 |

Updated |
26 Aug 2010 |

Type |
Conference |

Year |
1995 |

Where |
ICPP |

Authors |
George Karypis, Vipin Kumar |

Comments (0)