Alternative representations of P systems solutions to the graph colouring problem

DOI10.1007/s41965-019-00013-2zbMath1431.68027OpenAlexW2946646516MaRDI QIDQ2299885

Radu Nicolescu, James Cooper

Publication date: 24 February 2020

Published in: Journal of Membrane Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s41965-019-00013-2

zbMATH Keywords

cP-systemsconcurrent MLgraph colouring problemsimple kernel P-systems

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (3)

Sublinear P system solutions to NP-complete problems ⋮ A bibliometric analysis of membrane computing (1998--2019) ⋮ Cell-like P systems with polarizations and minimal rules

Uses Software

• SPIN
• jSpin
• MeCoSim
• P-Lingua
• gCol

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On generalized communicating P systems with minimal interaction rules
• A uniform family of tissue P systems with cell division solving 3-COL in a linear time
• An introduction to \(\mathrm{cP}\) systems
• 3-Col problem modelling using simple kernel P systems
• FORMAL VERIFICATION OF P SYSTEMS USING SPIN
• A Guide to Graph Colouring
• 3-coloring in time
• The Hamiltonian Cycle and Travelling Salesman Problems in cP Systems
• Concurrent Programming in ML
• Developments in Language Theory

This page was built for publication: Alternative representations of P systems solutions to the graph colouring problem