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.
Algebraic Distance<br />
Relaxation Process<br />
Goal: distinguish local and non-local edges<br />
∀ i ∈ V : x i := rand()<br />
Do k times<br />
∀ i ∈ V : x k<br />
i := (1 − α)x k−1<br />
i<br />
7 <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 />
+ α ∑j ωijx k−1<br />
j / ∑ij ωij Conjecture<br />
If |x k<br />
i − xk<br />
j | > |xk u − xk v | then the local connectivity between u and v is<br />
stronger than that between i and j.<br />
Department of In<strong>for</strong>matics<br />
Institute <strong>for</strong> Theoretical Computer Science, Algorithmics II<br />
40<br />
20
Change language