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.
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 />
SEEDS<br />
13 <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