Learning algorithm for the uniform graph partitioning problem

Abstract

We study the uniform graph partitioning problem using the learning algorithm proposed by one of us. We discuss the characteristics of the learning algorithm and compare the performance of the algorithm empirically with the Kernighan-Lin algorithm on a range of instances. Even with a simple implementation, the learning algorithm is capable of producing very good results.