Solving Hamilton Path Problem with P System

摘要：

　　P systems are biologically inspired theoretical models of distributed and parallel computing.Hamilton path is a classical NP problem, recently, there are lots of methods to solve it.Today we give a new and efficient algorithm to this classic.This paper uses the improved P system with priority and promoters/inhibitors to give an efficient solution to Hamilton path problem.We give two examples to illustrate our methods feasibility.We discuss future research problems also.

关键词： P system Hamilton Path Priority Promoter Inhibitor Polynomial Time

作者: Laisheng Xiang Jie Xue

作者单位: School of Management Science and Engineering, Shandong Normal University, Jinan 250014 Shandong, China

会议类型: 国际会议

会议名称: 4th international Conference,ICSI2013(第4届群体智能国际会议)

会议地点: 哈尔滨

会议语种:英文

页码: 351-359

在线出版日期: 2013-06-12（万方平台首次上网日期，不代表论文的发表时间）