Skip to main content

Solving Graph Problems by P Systems with Restricted Elementary Active Membranes

  • Chapter
Aspects of Molecular Computing

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2950))

Abstract

P systems are parallel molecular computing models based on processing multisets of objects in cell-like membrane structures. In this paper we give membrane algorithms to solve the vertex cover problem and the clique problem in linear time with respect to the number of vertices and edges of the graph by recognizing P systems with active membranes using 2-division. Also, the linear time solution of the vertex cover problem is given using P systems with active membranes using 2-division and linear resources.

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

Access this chapter

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. Garey, M.R., Johnson, D.J.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  2. Păun, G.: Computing withMembranes. Journal of Computer and System Sciences 61(1), 108–143 (2000); TUCS Research Report 208 (1998), http://www.tucs.fi

  3. Păun, G.: P Systems with Active Membranes: Attacking NP-Complete Problems. Journal of Automata, Languages and Combinatorics 6(1), 75–90 (2001)

    MATH  MathSciNet  Google Scholar 

  4. Păun, G.: Membrane Computing: an Introduction. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  5. Pérez-Jiménez, M.J., Romero-Jiménez, A., Sancho-Caparrini, F.: Complexity Classes in Cellular Computing with Membranes. In: Cavaliere, M., Martín-Vide, C., Păun, G. (eds.) Proceedings of Brainstorming Week on Membrane Computing, Tarragona, Spain, February 2003, pp. 270–278 (2003)

    Google Scholar 

  6. Pérez-Jiménez, M.J., Romero-Jiménez, A., Sancho-Caparrini, F.: A Polynomial Complexity Class in P Systems Using Membrane Division. In: Proceedings of the 5th Workshop on Descriptional Complexity of Formal Systems, Budapest, Hungary, July 12-14 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Alhazov, A., Martín-Vide, C., Pan, L. (2003). Solving Graph Problems by P Systems with Restricted Elementary Active Membranes. In: Jonoska, N., Păun, G., Rozenberg, G. (eds) Aspects of Molecular Computing. Lecture Notes in Computer Science, vol 2950. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24635-0_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24635-0_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20781-8

  • Online ISBN: 978-3-540-24635-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics