Home » Research » Projects

Graph Partitioning

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

  1. A Unified Algorithm for Load-balancing Adaptive Scientific Simulations. Kirk Schloegel, George Karypis, and Vipin Kumar.  Supercomputing, 2000.

  1. Parallel Multilevel Algorithms for Multi-Constraint Graph Partitioning. Kirk Schloegel, George Karypis, and Vipin Kumar.  Euro-Par, pp: 296-310, 2000.

  1. Parallel Multilevel k-way Partitioning Scheme for Irregular Graphs. George Karypis and Vipin Kumar.  SIAM Review, Vol. 41, No. 2, pp. 278 - 300, 1999.

  1. Multilevel Hypergraph Partitioning: Applications in VLSI Domain. George Karypis, Rajat Aggarwal, Vipin Kumar, and Shashi Shekhar.  IEEE Transactions on VLSI Systems, Vol. 7, No. 1, pp. 69-79, 1999.

  1. A fast and high quality multilevel scheme for partitioning irregular graphs. George Karypis and Vipin Kumar.  SIAM Journal on Scientific Computing, Vol. 20, No. 1, pp. 359 - 392, 1999.

  1. Multilevel Algorithms for Multi-Constraint Hypergraph Partitioning. George Karypis.  UMN CS #99-034, 1999.

  1. Multilevel k-way Hypergraph Partitioning. George Karypis and Vipin Kumar.  36th Design Automation Conference, pp. 343 - 348, 1999.

  1. A Parallel Algorithm for Multilevel Graph Partitioning and Sparse Matrix Ordering. George Karypis and Vipin Kumar.  Journal of Parallel and Distributed Computing, Vol. 48, pp. 71 - 85, 1998.

  1. Multilevel Algorithms for Multi-Constraint Graph Partitioning. George Karypis and Vipin Kumar.  Supercomputing, 1998.

  1. Dynamic Repartitioning of Adaptively Refined Meshes. Kirk Schloegel, George Karypis, and Vipin Kumar.  Supercomputing, 1998.

  1. A Performance Study of Diffusive vs. Remapped Load-Balancing Schemes. Kirk Schloegel, George Karypis, Vipin Kumar, Rupak Biswas, and Leonid Oliker.  11th Intl. Conference on Parallel and Distributed Computing Systems, 1998.

  1. Multilevel k-way Partitioning Scheme for Irregular Graphs. George Karypis and Vipin Kumar.  J. Parallel Distrib. Comput. 48(1): 96-129, 1998.
« first‹ previous123next ›last »