Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Pǎun, G.: A quick introduction to membrane computing. The Journal of Logic and Algebraic Programming 79, 291–294 (2010)
DÃa-Pernil, D., Gutirúez-Naranjo, M.A., Peréz-Jiménz, M.J., Riscos-Núnez, A.: A Linear-time Tissue P System Based Solution for the 3-coloring Problem. Electronic Notes in Theoretical Computer Science 171, 81–89 (2007)
Ionescu, M., Păun, G., Yokomori, T.: Spiking neural P systems. Fundamenta Informaticae 71(2-3), 279–308 (2006)
Pan, L., Alhazov, A.: Solving HPP and SAT by P systems with active membranes and separation rules. Acta Informatica 43, 131–145 (2006)
Leporati, A., Mauri, G., Zandron, C., Păun, G., Pérez-Jiménez, M.J.: Uniform solutions to sat and Subset Sum by spiking neural P systems. Natural Computing 8(4), 681–702 (2009)
Leporati, A., Zandron, C., Ferretti, C., Mauri, G.: Solving Numerical NP-Complete Problems with Spiking Neural P Systems. In: Eleftherakis, G., Kefalas, P., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2007. LNCS, vol. 4860, pp. 336–352. Springer, Heidelberg (2007)
Leporati, A., Zandron, C., Ferretti, C., Mauri, G.: On the computational power of spiking neural P systems. International Journal of Unconventional Computing 5(5), 459–473 (2009)
Pan, L., Zeng, X., Zhang, X., Jiang, Y.: Spiking Neural P Systems with Weighted Synapses. Neural Process. Lett. 35, 13–27 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xue, J., Liu, X. (2013). Solving Directed Hamilton Path Problem in Parallel by Improved SN P System. In: Zu, Q., Hu, B., Elçi, A. (eds) Pervasive Computing and the Networked World. ICPCA/SWS 2012. Lecture Notes in Computer Science, vol 7719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37015-1_60
Download citation
DOI: https://doi.org/10.1007/978-3-642-37015-1_60
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37014-4
Online ISBN: 978-3-642-37015-1
eBook Packages: Computer ScienceComputer Science (R0)