Graph Partitioning using Artificial Fish Algorithm
عنوان مقاله: Graph Partitioning using Artificial Fish Algorithm
شناسه ملی مقاله: ICS11_268
منتشر شده در یازدهمین کنفرانس سراسری سیستم های هوشمند در سال 1391
شناسه ملی مقاله: ICS11_268
منتشر شده در یازدهمین کنفرانس سراسری سیستم های هوشمند در سال 1391
مشخصات نویسندگان مقاله:
Sina Zangbari Kouhi - Aras International Campus, University of Tabriz
Faranak Nejati - Aras International Campus, University of Tabriz
Shahriar Lotfi - Department of Computer Science, University of Tabriz
خلاصه مقاله:
Sina Zangbari Kouhi - Aras International Campus, University of Tabriz
Faranak Nejati - Aras International Campus, University of Tabriz
Shahriar Lotfi - Department of Computer Science, University of Tabriz
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, Approximation Algorithm, Artificial Fish
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/214847/