An effective ant colony algorithm for graph planarization problem

Authors:
Li-Qing Zhao;Cui Zhang;Rong-Long Wang
Affiliations:
Graduate School of Engineering, University of Fukui, Fukui-shi, Japan;Department of Autocontrol, Liaoning Institute of Science and Technology, Benxi, China;Graduate School of Engineering, University of Fukui, Fukui-shi, Japan
Venue:
ICIC'11 Proceedings of the 7th international conference on Intelligent Computing: bio-inspired computing and applications
Year:
2011

Citing 5
Cited 0

An O(m log n)-time algorithm for the maximal planar subgraph problem

SIAM Journal on Computing
Efficient Planarity Testing

Journal of the ACM (JACM)
A Linear Time Algorithm For Finding Maximal Planar Subgraphs

ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation
Solving the Graph Planarization Problem Using an Improved Genetic Algorithm

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Incremental planarity testing

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, an effective ant colony algorithm is proposed for solving the graph planarization problem. In the proposed algorithm, two kinds of pheromone are adopted to reinforce the search ability, and each kind of pheromone consists of two elements. The proposed algorithm is verified by a large number of simulation runs and compared with other algorithms. The experiment results show that the proposed algorithm performs remarkably well and outperforms its competitors.