Local Refinement for Graph Partitioning Based on Level Structure
Graph partitioning is a fundamental problem in several scientific and engineering applications. In this paper, we propose a heuristic local refinement algorithm for graph partitioning, which seeks to improve the quality of separators by reducing the width of the level structure. The experiments reported in this paper show that the use of our local refinement algorithm results in a considerable improvement in the quality of partitions over conventional graph partitioning scheme based on level structure.
Elwin Mao and Linli Xu
L. Yao et al., "Local Refinement for Graph Partitioning Based on Level Structure", Advanced Engineering Forum, Vol. 1, pp. 257-261, 2011