Advertisement

Solving Graph Problems by P Systems with Restricted Elementary Active Membranes

  • Artiom Alhazov
  • Carlos Martín-Vide
  • Linqiang Pan
Chapter
Part of the Lecture Notes in Computer Science book series (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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Garey, M.R., Johnson, D.J.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)zbMATHGoogle Scholar
  2. 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. 3.
    Păun, G.: P Systems with Active Membranes: Attacking NP-Complete Problems. Journal of Automata, Languages and Combinatorics 6(1), 75–90 (2001)zbMATHMathSciNetGoogle Scholar
  4. 4.
    Păun, G.: Membrane Computing: an Introduction. Springer, Heidelberg (2002)zbMATHGoogle Scholar
  5. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Artiom Alhazov
    • 1
    • 2
  • Carlos Martín-Vide
    • 2
  • Linqiang Pan
    • 2
    • 3
  1. 1.Institute of Mathematics and Computer ScienceAcademy of Science of MoldovaChişinăuMoldova
  2. 2.Research Group on Mathematical LinguisticsRovira i Virgili UniversityTarragonaSpain
  3. 3.Department of Control Science and EngineeringHuazhong University of Science and TechnologyWuhanPeople’s Republic of China

Personalised recommendations