METIS - Serial Graph Partitioning and Fill-reducing Matrix Ordering

Related research publications

  1. A Parallel Hill-Climbing Refinement Algorithm for Graph Partitioning.

    Dominique LaSalle and George Karypis. 45th International Conference on Parallel Processing (ICPP), 2016.

  1. Improving Graph Partitioning for Modern Graphs and Architectures.

    Dominique LaSalle, Md Mostofa Ali Patwary, Nadathur Satish, Narayanan Sundaram, Pradeep Dubey, and George Karypis. 5th Workshop on Irregular applications: Architectures and Algorithms, Supercomputing, 2015.

  1. Efficient Nested Dissection for Multicore Architectures.

    Dominique LaSalle and George Karypis. EuroPar, 2015.

  1. Multi-Threaded Graph Partitioning.

    Dominique LaSalle and George Karypis. 27th IEEE International Parallel & Distributed Processing Symposium, 2013.

  1. Multilevel Algorithms for Partitioning Power-Law Graphs.

    Amine Abou-Rjeili and George Karypis. IEEE International Parallel & Distributed Processing Symposium (IPDPS), 2006.

  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 Graph Partitioning.

    George Karypis and Vipin Kumar. Supercomputing, 1998.

  1. Multilevel k-way Partitioning Scheme for Irregular Graphs.

    George Karypis and Vipin Kumar. J. Parallel Distrib. Comput. 48(1): 96-129, 1998.

  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.