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.
Modified Algorithm<br />
Likelihood <strong>for</strong> v ∈ V<br />
if v ∈ C then Pv,v = 1<br />
else<br />
find max pair (1/ρe 1 +<br />
1/ρe 2 )<br />
s.t. coarse vertices not<br />
overloaded when<br />
splitting v<br />
restrict to at most two strongest connections → sparsity<br />
avoid overloaded vertices<br />
18 <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