A Linear--time Tissue P System Based Solution for the 3--coloring Problem

Authors:
Daniel Díaz-Pernil;Miguel A. Gutiérrez-Naranjo;Mario J. Pérez-Jiménez;Agustín Riscos-Núòez
Affiliations:
Research Group on Natural Computing, Dpto. de Ciencias de la Computación e Inteligencia Artificial, Universidad de Sevilla, Sevilla, Spain;Research Group on Natural Computing, Dpto. de Ciencias de la Computación e Inteligencia Artificial, Universidad de Sevilla, Sevilla, Spain;Research Group on Natural Computing, Dpto. de Ciencias de la Computación e Inteligencia Artificial, Universidad de Sevilla, Sevilla, Spain;Research Group on Natural Computing, Dpto. de Ciencias de la Computación e Inteligencia Artificial, Universidad de Sevilla, Sevilla, Spain
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 16
Cited 3

Computing with membranes

Journal of Computer and System Sciences
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Membrane Computing: An Introduction

Membrane Computing: An Introduction
The power of communication: P systems with symport/antiport

New Generation Computing
A New Class of Symbolic Abstract Neural Nets: Tissue P Systems

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Solving NP-Complete Problems Using P Systems with Active Membranes

UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
Tissue P Systems with Contextual and Rewriting Rules

WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Simulating Counter Automata by P Systems with Symport/Antiport

WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Tissue P systems

Theoretical Computer Science
Planar 3-colorability is polynomial complete

ACM SIGACT News
Tissue P systems with channel states

Theoretical Computer Science - Insightful theory
Cell communication in tissue P systems: universality results

Soft Computing - A Fusion of Foundations, Methodologies and Applications
Spiking Neural P Systems

Fundamenta Informaticae
A linear solution for QSAT with membrane creation

WMC'05 Proceedings of the 6th international conference on Membrane Computing
Tissue p systems with antiport rules and small numbers of symbols and cells

DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Brane calculi

CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology

Solving Subset Sum in Linear Time by Using Tissue P Systems with Cell Division

IWINAC '07 Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks
A Tissue P Systems Based Uniform Solution to Tripartite Matching Problem

Fundamenta Informaticae
Solving directed hamilton path problem in parallel by improved SN p system

ICPCA/SWS'12 Proceedings of the 2012 international conference on Pervasive Computing and the Networked World

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the literature, several examples of the efficiency of cell-like P systems regarding the solution of NP-complete problems in polynomial time can be found (obviously, trading space for time). Recently, different new models of tissue-like P systems have received important attention from the scientific community. In this paper we present a linear-time solution to an NP-complete problem from graph theory, the 3-coloring problem, and we discuss the suitability of tissue-like P systems as a framework to address the efficient solution to intractable problems.