Alternative representations of P systems solutions to the graph colouring problem
From MaRDI portal
Recommendations
- 3-Col problem modelling using simple kernel P systems
- A linear-time tissue P system based solution for the 3-coloring problem
- Solving the 3-COL problem by using tissue P systems without environment and proteins on cells
- A uniform family of tissue P systems with protein on cells solving 3-coloring in linear time
- Aspects of Molecular Computing
Cites work
- 3-Col problem modelling using simple kernel P systems
- 3-coloring in time
- A guide to graph colouring. Algorithms and applications
- A uniform family of tissue P systems with cell division solving 3-COL in a linear time
- An introduction to cP systems
- Concurrent Programming in ML
- Developments in Language Theory
- FORMAL VERIFICATION OF P SYSTEMS USING SPIN
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- On generalized communicating P systems with minimal interaction rules
- Principles of the SPIN model checker. Foreword by Gerard J. Holzmann
- Spiking neural P systems
- The Hamiltonian Cycle and Travelling Salesman Problems in cP Systems
Cited in
(7)- Cell-like P systems with polarizations and minimal rules
- 3-Col problem modelling using simple kernel P systems
- Sublinear P system solutions to NP-complete problems
- A bibliometric analysis of membrane computing (1998--2019)
- Solving the SAT problem by cell-like P systems with channel states and symport rules
- Homeostasis tissue-like P systems with cell separation
- Solving the 3-COL problem by using tissue P systems without environment and proteins on cells
This page was built for publication: Alternative representations of P systems solutions to the graph colouring problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2299885)
