Graph Partitioning using Artificial Fish Algorithm

The problem of partitioning graphs connected into balance componentsis used in many computations. This problem is considered a NP-complete problem and since it is very important and has many applications, tools and solutions that have been suggested to it. Some of these solutions are heuristic and approximate algorithms. In this paper, we have used approximate optimization algorithm of artificial fish, which is derived from group behaviour of fish, to tackle this problem. In this algorithm, the behaviour of individual fish and their interactions are used and considerable results can be obtained

Graph Partitioning using Artificial Fish Algorithm Keywords:

Graph partitioning , Approximation Algorithm , Artificial Fish