Solving the Graph Problem on the Maximal Clique Problem on the P-Systems with Mitochondria Enzymes Layer
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 polynomia...
Main Authors: | Ford Lumban Gaol, Tokuro Matsuo |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-12-01
|
Series: | Applied Sciences |
Subjects: | |
Online Access: | https://www.mdpi.com/2076-3417/10/1/275 |
Similar Items
-
On clique convergence of graphs
by: S.M. Hegde, et al.
Published: (2016-12-01) -
Creating a Maximal Clique Graph to Improve Community Detection in SCoDA and OSLOM Algorithms
by: Sasan Sabour, et al.
Published: (2019-12-01) -
On Finding and Enumerating Maximal and Maximum k-Partite Cliques in k-Partite Graphs
by: Charles A. Phillips, et al.
Published: (2019-01-01) -
An Efficient Influence Maximization Algorithm Based on Clique in Social Networks
by: Huan Li, et al.
Published: (2019-01-01) -
Cliques and Clique Covers in Interval-Valued Fuzzy Graphs
by: Napur Patra, et al.
Published: (2021-06-01)