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 />
C-points Selection<br />
find dominating set C ⊂ V s.t. F = V \ C “strongly coupled” to C<br />
each node in C is a seed of a coarse aggregate<br />
C = ∅, F = V<br />
until<br />
∀u ∈ F : ∑v∈C 1/ρu,v ≥ θ ∑v∈N(u) 1/ρu,v<br />
transfer node from F to C<br />
θ ∈ (0, 1), usually θ = 0.5<br />
14 <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 />
SEEDS<br />
Department of In<strong>for</strong>matics<br />
Institute <strong>for</strong> Theoretical Computer Science, Algorithmics II
Change language