A Multiagent Algorithm for Graph Partitioning

The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algorithms have been proposed for this problem based on heuristic, geometrical and evolutionary methods. In this paper we present a new simple multiagent algorithm, ants, and we test its performance with standard graph benchmarks. The results show that this method can outperform several current methods while it is very simple to implement.

• Type: Conference
• Year: 2006
• Where: EVOW
• Authors: Francesc Comellas, Emili Sapena
• Keywords: Artificial Intelligence, EVOW 2006, NP-complete Problem, Simple Multiagent Algorithm, Standard Graph Benchmarks