Membrane computing to enhance time efficiency of minimum dominating set

DOI10.1007/s11786-016-0261-5zbMath1341.68050OpenAlexW2325797347MaRDI QIDQ2630783

Ali Abdulkareem Mahmood, Ravie Chandren Muniyandi, Ali Maroosi

Publication date: 22 July 2016

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-016-0261-5

zbMATH Keywords

parallel computingP systemsactive membrane systemsminimum dominating set

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Accelerated execution of P systems with active membranes to solve the \(N\)-queens problem
• A uniform family of tissue P systems with cell division solving 3-COL in a linear time
• Unit disk graphs
• 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs.
• Membrane computing. An introduction.
• On the power of membrane division in P systems
• A note on the complexity of minimum dominating set
• Solving the subset-problem by P systems with active membrans
• Linear-time computability of combinatorial problems on series-parallel graphs
• What cannot be computed locally!
• Constant-time distributed dominating set approximation