Solving Graph Problems by P Systems with Restricted Elementary Active Membranes
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.
Unable to display preview. Download preview PDF.
- 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
- 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