Advanced Coarsening Schemes for Graph Partitioning - Ilya ... - KIT
Advanced Coarsening Schemes for Graph Partitioning - Ilya ... - KIT
Advanced Coarsening Schemes for Graph Partitioning - Ilya ... - KIT
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Coarse Nodes<br />
classical AMG interpolation matrix P<br />
express likelihood of v belonging to c ∈ C → P ∈ R |V |x|C|<br />
16 <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 />
Belong to several aggregates<br />
Lc = P t L f P<br />
volume of c(q ∈ C) := ∑v c(v)Pv,q (sum of weights constant)<br />
wc 1,c 2 = ∑k=l P k,c1 w k,lP l,c2<br />
Department of In<strong>for</strong>matics<br />
Institute <strong>for</strong> Theoretical Computer Science, Algorithmics II
Change language