A Linear--time Tissue P System Based Solution for the 3--coloring Problem
Electronic Notes in Theoretical Computer Science (ENTCS)
Uniform solutions to SAT and Subset Sum by spiking neural P systems
Natural Computing: an international journal
Solving numerical NP-complete problems with spiking neural P systems
WMC'07 Proceedings of the 8th international conference on Membrane computing
Spiking Neural P Systems with Weighted Synapses
Neural Processing Letters
Fundamenta Informaticae
| Hi-index | 0.00 |
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.