Advertisement
Published in:
2013 | OriginalPaper | Chapter
Solving Directed Hamilton Path Problem in Parallel by Improved SN P System
Authors : Jie Xue, Xiyu Liu
Published in: Pervasive Computing and the Networked World
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
The directed Hamiltonian path (DHP) problem is one of the hard computational problems for which there is no practical algorithm on conventional computer available. Many problems, including the traveling sales person problem and the longest path problem, can be translated into DHP problems. Inspired by the biological neurons, priority of rules in membrane computing, we introduce spiking neural P systems with priority and multiple output neurons into the application of DHP problems. In this paper, a new SN P System based algorithm is presented. We use neurons to stand for all the possible path and filter out the DHP we want automatically, all the processes will implement in the new SN P system. Instances indicate that the proposed SN P system based algorithm reduces the time complexity efficiently by huge parallelism.