A Multi-Level Algorithm For Partitioning Graphs
Citations
5,629 citations
Cites background or methods from "A Multi-Level Algorithm For Partiti..."
...These are called multilevel graph partitioning schemes [4, 7, 19, 20, 26, 10, 43]....
[...]
...We also present a new variation of the Kernighan-Lin algorithm for refining the partition during the uncoarsening phase that is much faster than the Kernighan-Lin refinement used in [26]....
[...]
...In this paper we build on the work of Hendrickson and Leland....
[...]
...Since both the coarsening phase and the refinement phase with the Kernighan-Lin heuristic take roughly the same amount of time, the overall run-time of the multilevel scheme of [26] cannot be reduced significantly....
[...]
...Compared with the multilevel scheme of [26], our scheme is about two to seven times faster, and is consistently better in terms of cut size....
[...]
1,715 citations
1,660 citations
Cites background from "A Multi-Level Algorithm For Partiti..."
...mbinatorial quantity; and it has a very natural interpretation in terms of random walks on the interaction graph. Moreover, since there exist a rich suite of both theoretical and practical algorithms [87, 149, 107, 108, 17, 95, 96, 162, 54], we can for point (4) compare and contrast several methods to approximately optimize it. To illustrate conductance, note that of the three 5-node sets A, B, and C illustrated in the graph in Figure 1...
[...]
1,555 citations
1,038 citations
Additional excerpts
...Ç...
[...]
References
5,082 citations
2,463 citations
2,200 citations
1,762 citations
834 citations
"A Multi-Level Algorithm For Partiti..." refers background or methods in this paper
...We use a spectral method [13, 21] for this problem, but in principle any partitioning algorithm could be used....
[...]
...More detailed descriptions of spectral bisection can be found in [10, 11, 13, 19, 21]....
[...]
...The rst competing algorithm is inertial bisection, descriptions of which can be found in [21, 27]....
[...]