检索结果-内蒙古大学图书馆

An Effective Ant Colony Algorithm for graph planarization problem

7th International Conference on Intelligent Computing (ICIC)

作者： Zhao, Li-Qing Zhang, Cui Wang, Rong-Long Univ Fukui Grad Sch Engn Bunkyo 3-9-1 Fukui 910 Japan Liaoning Inst Sci & Technol Dept Autocontrol Benxi Peoples R China

ISBN: (纸本)9783642245527;9783642245534

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.

关键词： graph planarization problem NP-complete problem Ant colony algorithm Pheromone

来源：评论

学校读者我要写书评

暂无评论

Solving the graph planarization problem using an improved genetic algorithm

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2006年第5期E89A卷 1507-1512页

作者： Wang, Rong-Long Okazaki, Kozo Univ Fukui Fac Engn Fukui 9108507 Japan

An improved genetic algorithm for solving the graph planarization problem is presented. The improved genetic algorithm which is designed to embed a graph on a plane, performs crossover and mutation conditionally instead of probability. The improved genetic algorithm is verified by a large number of simulation runs and compared with other algorithms. The experimental results show that the improved genetic algorithm per-forms remarkably well and outperforms its competitors.

关键词： graph planarization problem NP-complete problem genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

A new neural network algorithm for planarization problems

引用

Science in China(Series F) 2008年第12期51卷 1947-1957页

作者： ZHANG JunYing QIN Qiang School of Computer Science and Engineering Xidian University Xi'an 710071 China

To deal with the planarization problem widely used in many applications including routing very-large-scale integration （VLSI） circuits, this paper points out that only when its vertices are arranged in some specific order in a line can a planar graph be embedded on a line without any cross connections or cross edges. Energy function is proposed to meet the need of embedding a graph on a single line and route it correctly. A Hopfield network is designed according to the proposed energy function for such embedding and routing. The advantage of the proposed method is that it not only can detect if a graph is a planar one or not, but also can embed a planar graph or the maximal planar subgraph of a non-planar graph on a single line. In addition, simulated annealing is employed for helping the network to escape from local minima during the running of the Hopfield network. Experiments of the proposed method and its comparison with some existent conventional methods were performed and the results indicate that the proposed method is of great feasibility and effectiveness especially for the planarization problem of large graphs.

关键词： graph planarization problem planar embedding algorithm Hopfield network energy function simulatedannealing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：