Graph Partitioning Using Improved Ant Clustering

Parallel computing. network partitioning. and VLSI circuit placement are fundamental challenges in computer science These problems can he modeled as graph partitioning problems A new Similarity carrying Ant Model (SCAM) is used in the ant-based clustering algorithm to solve graph partitioning problem In the proposed model. the ant will be able to collect similar items while it moves around The flexible template mechanism had been used integrated with the proposed model to obtain the partitioning constrains Random graph has been used to compare the new model with the original ant model and the model with short-term memory The result of the experiments proves the Impact of the SCAM compared with other models This performance improvement for ant clustering algorithm makes it is feasible to be used in graph portioning problem