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.
Experimental Results<br />
Potentially Hard <strong>Graph</strong>s<br />
potentially hard mixtures (star-like structures)<br />
mixtures of snw, fem graphs, VLSI, ...<br />
S 0, . . . , St connected center S 0 by ≤ 3% random edges<br />
ECO-ALG<br />
AMG-ECO<br />
ECO-ALG<br />
AMG-ECO<br />
23 <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 />
STRONG<br />
AMG<br />
STRONG<br />
AMG<br />
k quality uncoar. time quality uncoar. time<br />
2 1.18 0.55 1.15 2.11<br />
4 1.23 0.64 1.13 1.69<br />
8 1.08 0.98 1.05 1.37<br />
Department of In<strong>for</strong>matics<br />
Institute <strong>for</strong> Theoretical Computer Science, Algorithmics II
Change language