Skip to main content
SpringerLink
Log in

Solving Hamilton Path Problem with P System

  • Conference paper
Advances in Swarm Intelligence (ICSI 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7929))

Included in the following conference series:

  • 2823 Accesses

Abstract

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 method’s feasibility. We discuss future research problems also.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Díaz-Pernil, D., Gutiérrez-Naranjo, M.A., Pérez-Jiménez, M.J., Riscos Núñez, A.: Linear–time Tissue P System Based Solutionfor the 3-coloring Problem. ENTCS 17, 181–193 (2007)

    Google Scholar 

  2. Pan, L., Mario, J.: Pérez-Jiménez: Computational complexity of tissue-like P systems. Journal of Complexity 26, 296–315 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  3. Pǎun, G., Rozenberg, G., Salomaa, A.: Membrane Computing. Oxford University Press (2008)

    Google Scholar 

  4. Pǎun, G.: A quick introduction to membrane computing. The Journal of Logic and Algebraic Programming 79, 291–294 (2010)

    Article  MathSciNet  Google Scholar 

  5. P systems web page, http://psystems.disco.unimib.it/

  6. Ceterchi, R., Martin-Vide, C.: P Systems with Communication for Static Sorting. GRLMC Report Rovira I Virgili University 101-117 (2003)

    Google Scholar 

  7. Pǎun, G.: The power of Communication: P Systems with Symport/Antiport. New Generation Computers 20(3), 295–306 (2002)

    Article  Google Scholar 

  8. Arulanandham, J.J.: Implementing Bead-Sort with P Systems. In: Calude, C.S., Dinneen, M.J., Peper, F. (eds.) UMC 2002. LNCS, vol. 2509, pp. 115–125. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Management Science and Engineering, Shandong Normal University, Jinan, 250014, Shandong, China

    Laisheng Xiang & Jie Xue

Authors
  1. Laisheng Xiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jie Xue
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Key Laboratory of Machine Perception (MOE), School of lectronics Engineering and Computer Science, Department of Machine Intelligence, Peking University, 100871, Beijing, China

    Ying Tan

  2. Department of Electrical and Electronic Engineering, Xi’an Jiaotong-Liverpool University, 215123, Suzhou, China

    Yuhui Shi

  3. Automation College, Harbin Engineering University, 150001, Harbin, China

    Hongwei Mo

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xiang, L., Xue, J. (2013). Solving Hamilton Path Problem with P System. In: Tan, Y., Shi, Y., Mo, H. (eds) Advances in Swarm Intelligence. ICSI 2013. Lecture Notes in Computer Science, vol 7929. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38715-9_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38715-9_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38714-2

  • Online ISBN: 978-3-642-38715-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation