Advanced Coarsening Schemes for Graph Partitioning - Ilya ... - KIT
Advanced Coarsening Schemes for Graph Partitioning - Ilya ... - KIT
Advanced Coarsening Schemes for Graph Partitioning - Ilya ... - KIT
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
ɛ-Balanced <strong>Graph</strong> <strong>Partitioning</strong><br />
Partition graph G = (V , E, c : V → R>0, ω : E → R>0)<br />
into k disjoint blocks s.t.<br />
1 + ɛ<br />
total node weight of each block ≤ total node weight<br />
k<br />
total weight of cut edges as small as possible<br />
Applications:<br />
FEM, linear equation systems, VLSI design, route planning, . . .<br />
4 <strong>Ilya</strong> Safro, Peter Sanders, Christian Schulz:<br />
<strong>Advanced</strong> <strong>Coarsening</strong> <strong>Schemes</strong> <strong>for</strong> <strong>Graph</strong> Partititoning<br />
Department of In<strong>for</strong>matics<br />
Institute <strong>for</strong> Theoretical Computer Science, Algorithmics II
Change language