Advanced Coarsening Schemes for Graph Partitioning

  • Ilya Safro
  • Peter Sanders
  • Christian Schulz
Conference paper

DOI: 10.1007/978-3-642-30850-5_32

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7276)
Cite this paper as:
Safro I., Sanders P., Schulz C. (2012) Advanced Coarsening Schemes for Graph Partitioning. In: Klasing R. (eds) Experimental Algorithms. SEA 2012. Lecture Notes in Computer Science, vol 7276. Springer, Berlin, Heidelberg

Abstract

The graph partitioning problem is widely used and studied in many practical and theoretical applications. Today multilevel strategies represent one of the most effective and efficient generic frameworks for solving this problem on large-scale graphs. Most of the attention in designing multilevel partitioning frameworks has been on the refinement phase. In this work we focus on the coarsening phase, which is responsible for creating structurally similar to the original but smaller graphs. We compare different matching- and AMG-based coarsening schemes, experiment with the algebraic distance between nodes, and demonstrate computational results on several classes of graphs that emphasize the running time and quality advantages of different coarsenings.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Ilya Safro
    • 1
  • Peter Sanders
    • 2
  • Christian Schulz
    • 2
  1. 1.Mathematics and Computer Science DivisionArgonne National LaboratoryUSA
  2. 2.Institute for Theoretical Informatics, Algorithmics IIKarlsruhe Institute of TechnologyGermany

Personalised recommendations