Solving Graph Problems by P Systems with Restricted Elementary Active Membranes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2950, Issue , 2004, Pages 1-22

  Alhazov, Artiom ^a,b   Martín Vide, Carlos ^b   Pan, Linqiang ^b,c  

^a INSTITUTE OF MATHEMATICS AND COMPUTER SCIENCE   (Moldova)

^b UNIVERSITAT ROVIRA I VIRGILI   (Spain)

^c HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH ALGORITHMS;

ACTIVE MEMBRANES; CLIQUE PROBLEMS; GRAPH PROBLEMS; LINEAR TIME; LINEAR-TIME SOLUTIONS; MOLECULAR COMPUTING; P SYSTEMS WITH ACTIVE MEMBRANES; VERTEX COVER PROBLEMS;

MEMBRANES;

EID: 33645591426     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (7)

1. M.R. Garey, D.J. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco, 1979.
2. Gh. Pǎun, Computing with Membranes, Journal of Computer and System Sciences, 61, 1 (2000), 108-143, and
3. TUCS Research Report 208, 1998 (http://www.tucs.fi).
4. Gh. Pǎun, P Systems with Active Membranes: Attacking NP-Complete Problems, Journal of Automata, Languages and Combinatorics, 6, 1 (2001), 75-90.
5. Gh. Pǎun, Membrane Computing: An Introduction, Springer, Berlin, Heidelberg, 2002.
6. M.J. Pérez-Jiménez, A. Romero-Jiménez, F. Sancho-Caparrini, Complexity Classes in Cellular Computing with Membranes, Proceedings of Brainstorming Week on Membrane Computing (M. Cavaliere, C. Martín-Vide and Gh. Pǎun eds.), Tarragona, Spain, February, (2003) 270-278.
7. M.J. Pérez-Jiménez, A. Romero-Jiménez, F. Sancho-Caparrini, A Polynomial Complexity Class in P Systems Using Membrane Division, Proceedings of the 5th Workshop on Descriptional Complexity of Formal Systems, Budapest, Hungary, July 12-14, 2003.