Document Open Access Logo

Weighted aggregation for multi-level graph partitioning

Authors Cédric Chevalier, Ilya Safro



PDF
Thumbnail PDF

File

DagSemProc.09061.21.pdf
  • Filesize: 85 kB
  • 1 pages

Document Identifiers

Author Details

Cédric Chevalier
Ilya Safro

Cite AsGet BibTex

Cédric Chevalier and Ilya Safro. Weighted aggregation for multi-level graph partitioning. In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, p. 1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
https://doi.org/10.4230/DagSemProc.09061.21

Abstract

Graph partitioning is a well-known optimization problem of great interest in theoretical and applied studies. Since the 1990s, many multilevel schemes have been introduced as a practical tool to solve this problem. A multilevel algorithm may be viewed as a process of graph topology learning at different scales in order to generate a better approximation for any approximation method incorporated at the uncoarsening stage in the framework. In this work we compare two multilevel frameworks based on the geometric and the algebraic multigrid schemes for the partitioning problem.
Keywords
  • Graph partitioning
  • multilevel
  • coarsening
  • weighted aggregation

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail