A Linear–time Tissue P System Based Solution for the 3–coloring Problem
From MaRDI portal
Publication:2864198
DOI10.1016/j.entcs.2007.05.009zbMath1277.68073OpenAlexW2088462532WikidataQ126239691 ScholiaQ126239691MaRDI QIDQ2864198
Mario J. Pérez-Jiménez, Daniel Díaz-Pernil, Miguel Á. Gutiérrez-Naranjo, Agustín Riscos-Núñez
Publication date: 6 December 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2007.05.009
Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (8)
Using membrane computing for effective homology ⋮ Sublinear P system solutions to NP-complete problems ⋮ Accelerated execution of P systems with active membranes to solve the \(N\)-queens problem ⋮ Lattice based communication P systems with applications in cluster analysis ⋮ A time-free uniform solution to subset sum problem by tissue P systems with cell division ⋮ A uniform solution to the independent set problem through tissue P systems with cell separation ⋮ Tissue P systems with cell separation: attacking the partition problem ⋮ Membrane parallelism for discrete Morse theory applied to digital images
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The power of communication: P systems with symport/antiport
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Tissue P systems.
- Computing with membranes
- Tissue P systems with channel states
- Membrane computing. An introduction.
- Cell communication in tissue \(P\) systems: universality results
- Developments in Language Theory
- Brane Calculi
- Membrane Computing
- Aspects of Molecular Computing
This page was built for publication: A Linear–time Tissue P System Based Solution for the 3–coloring Problem
