Graph Partitioning Using Tabu Search

Abstract

In this paper, we present another approach to the balanced minimum cut graph partitioning problem. This approach is based on the meta-heuristic known as tabu search. Our experimental results compare favorably with two of the most effecitive methods available in terms of quality of solutions and computational times. Our experience and experiments suggest that this technique can be applied effectively to many NP-hard combinatorial optimization problems.

2 Figures and Tables

Cite this paper

@inproceedings{Lim2004GraphPU, title={Graph Partitioning Using Tabu Search}, author={Andrew Lim}, year={2004} }