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.
Motivation<br />
Social Networks<br />
<strong>Graph</strong> <strong>Partitioning</strong> Problem:<br />
Partition a graph into (almost) equally sized blocks, such that the<br />
number of edges connecting vertices from different blocks is minimal.<br />
3 <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