•  
  •  
 

Author Country (or Countries)

Republic of Korea

Abstract

In iterative improvement partitioning algorithms, tie-breaking in the choice of maximum-gain vertices has a great impact on the performance. We propose a new tie-breaking strategy in an iterative improvement algorithm for graph partitioning. The proposed method is simple but nevertheless performed better than other traditional techniques.

Suggested Reviewers

N/A

Share

COinS