DagSemProc.09061.21.pdf
- Filesize: 85 kB
- 1 pages
Document
Weighted aggregation for multi-level graph partitioning
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 9061
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2009-07-24
Cite As Get 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.
Subject Classification
Keywords
- Graph partitioning
- multilevel
- coarsening
- weighted aggregation
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads