Home » Research » Projects

Graph Partitioning

Here is a list of publications that are directly related to our graph partitioning research.

  1. Parallel Multilevel Diffusion Algorithms for Repartitioning of Adaptive Meshes. Kirk Schloegel, George Karypis, and Vipin Kumar.  UMN CS #97-014, 1997.

  1. Repartitioning of Adaptive Meshes: Experiments with Multilevel Diffusion. Kirk Schloegel, George Karypis, and Vipin Kumar.  Third Intl. Euro-Par Conference, 1997.

  1. Multilevel Diffusion Schemes for Repartitioning of Adaptive Meshes. Kirk Schloegel, George Karypis, and Vipin Kumar.  Journal of Parallel and Distributed Computing, Vol. 47, pp. 109 - 124, 1997.

  1. A Coarse-Grain Parallel Formulation of Multilevel k-way Graph Partitioning Algorithm. George Karypis and Vipin Kumar.  8th SIAM Conference on Parallel Processing for Scientific Computing, 1997.

  1. Multilevel Hypergraph Partitioning: Applications in VLSI Domain. George Karypis, Rajat Aggarwal, Vipin Kumar, and Shashi Shekhar.  34th Design and Automation Conference, pp. 526 - 529, 1997.

  1. Parallel Multilevel k-way Partitioning Scheme for Irregular Graphs. George Karypis and Vipin Kumar.  Supercomputing, 1996.

  1. A Parallel Algorithm for Multilevel Graph Partitioning and Sparse Matrix Ordering. George Karypis and Vipin Kumar.  10th Intl. Parallel Processing Symposium, pp. 314 - 319, 1996.

  1. Analysis of Multilevel Graph Partitioning. George Karypis and Vipin Kumar.  Supercomputing, 1995.

  1. A fast and high quality multilevel scheme for partitioning irregular graphs. George Karypis and Vipin Kumar.  International Conference on Parallel Processing, pp. 113-122, 1995.
« first‹ previous123