License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-20820
URL: http://drops.dagstuhl.de/opus/volltexte/2009/2082/

Chevalier, Cédric ; Safro, Ilya

Weighted aggregation for multi-level graph partitioning

pdf-format:
Dokument 1.pdf (86 KB)


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.

BibTeX - Entry

@InProceedings{chevalier_et_al:DSP:2009:2082,
  author =	{C{\'e}dric Chevalier and Ilya Safro},
  title =	{Weighted aggregation for multi-level graph partitioning},
  booktitle =	{Combinatorial Scientific Computing},
  year =	{2009},
  editor =	{Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
  number =	{09061},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/2082},
  annote =	{Keywords: Graph partitioning, multilevel, coarsening, weighted aggregation}
}

Keywords: Graph partitioning, multilevel, coarsening, weighted aggregation
Seminar: 09061 - Combinatorial Scientific Computing
Issue date: 2009
Date of publication: 24.07.2009


DROPS-Home | Fulltext Search | Imprint Published by LZI