Alternative representations of P systems solutions to the graph colouring problem

ResearchSpace Repository

Show simple item record Cooper, James en Nicolescu, Radu en 2019-10-29T02:27:04Z en 2019-06 en
dc.identifier.issn 2523-8906 en
dc.identifier.uri en
dc.description.abstract This paper first presents a simulation of the simple kernel P systems solution to the graph 3-colouring problem presented in a previous paper by Gheorghe et al., implemented in a programming style named Concurrent ML, which is based on the concept of synchronous communication between logical processing elements. This paper then presents and informally analyses an alternative compact single-cell solution to the same problem using P systems with compound objects (cP systems), which has the benefit of naturally adapting to the use of any number of colours greater than zero—only the specified colour symbols need to be changed. Successful and failing examples of the latter solution are also presented. en
dc.relation.ispartofseries Journal of Membrane Computing en
dc.rights Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. en
dc.rights.uri en
dc.title Alternative representations of P systems solutions to the graph colouring problem en
dc.type Journal Article en
dc.identifier.doi 10.1007/s41965-019-00013-2 en
pubs.issue 2 en
pubs.begin-page 112 en
pubs.volume 1 en
dc.rights.holder Copyright: The author en en
pubs.end-page 126 en
dc.rights.accessrights en
pubs.subtype Article en
pubs.elements-id 783420 en Science en School of Computer Science en
dc.identifier.eissn 2523-8914 en
pubs.record-created-at-source-date 2019-10-03 en 2019-05-14 en

Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record


Search ResearchSpace

Advanced Search