Back to Search
Start Over
Solving the Graph Problem on the Maximal Clique Problem on the P-Systems with Mitochondria Enzymes Layer.
- Source :
- Applied Sciences (2076-3417); Jan2020, Vol. 10 Issue 1, p275, 12p
- Publication Year :
- 2020
-
Abstract
- P systems with mitochondria enzymes layer computing is a recent version of P systems; it integrates a new feature inspired from the enzymes gate of a natural cell to the cell-like P systems. The model of a computational layer is well known as a problem of Non-Deterministic (NP-complete) in polynomial time. In this paper, we propose a P systems with enzymes to solve one of the most NP-hard problems, which is the determination of the maximal clique in a given undirected graph. In this context, the evolution strategy proposed is based on using objects under the control of enzymes placed on layers. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 20763417
- Volume :
- 10
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- Applied Sciences (2076-3417)
- Publication Type :
- Academic Journal
- Accession number :
- 141334440
- Full Text :
- https://doi.org/10.3390/app10010275