2026-07-20T10:41:55Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2082 2024-03-06T11:08:36Z ddc:004 open_access

Weighted aggregation for multi-level graph partitioning Chevalier, Cédric Safro, Ilya Graph partitioning multilevel coarsening weighted aggregation 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Cédric Chevalier and Ilya Safro 2009 Is Part Of Dagstuhl Seminar Proceedings, Volume 9061, Combinatorial Scientific Computing (2009) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.09061.21 urn:nbn:de:0030-drops-20820 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.21 eng https://creativecommons.org/licenses/by/4.0/legalcode