Local Refinement for Graph Partitioning Based on Level Structure

Abstract:

Article Preview

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.

Info:

Periodical:

Edited by:

Elwin Mao and Linli Xu

Pages:

257-261

DOI:

10.4028/www.scientific.net/AEF.1.257

Citation:

L. Yao et al., "Local Refinement for Graph Partitioning Based on Level Structure", Advanced Engineering Forum, Vol. 1, pp. 257-261, 2011

Online since:

September 2011

Export:

In order to see related information, you need to Login.

In order to see related information, you need to Login.