A linear time complexity of breadth-first search using P system with membrane division

DOI10.1155/2013/424108zbMATH Open1296.68052OpenAlexW1996709931WikidataQ59027413 ScholiaQ59027413MaRDI QIDQ459939FDOQ459939

Authors: Einallah Salehi, Kourosh Nemati, Siti Mariyam Shamsuddin 

Publication date: 13 October 2014

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/424108

Recommendations

• Depth-first search with P systems
• scientific article; zbMATH DE number 1958491
• Time-free solution to independent set problem using P systems with active membranes
• scientific article
• Solution to PSPACE-complete problem using P systems with active membranes with time-freeness

Mathematics Subject Classification ID

Cites Work

• Computing with membranes
• New solutions for disjoint paths in P systems
• BFS Solution for Disjoint Paths in P Systems
• Title not available (Why is that?)
• Tissue P systems.
• A tissue P systems based uniform solution to tripartite matching problem
• Spiking neural P systems with neuron division and budding
• Spiking neural P systems
• Computational complexity of tissue-like P systems
• Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs
• The computational power of cell division in P systems: Beating down parallel computers?
• P systems with active membranes: Attacking NP-complete problems
• Title not available (Why is that?)
• Time-free spiking neural P systems
• Smaller universal spiking neural P systems
• Solving HPP and SAT by P systems with active membranes and separation rules
• Depth-first search with P systems
• Membrane Computing
• A uniform family of tissue P systems with cell division solving 3-COL in a linear time
• Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
• On the power of membrane division in P systems
• FACC: a novel finite automaton based on cloud computing for the multiple longest common subsequences search
• Merged search algorithms for radio frequency identification anticollision
• Improved degree search algorithms in unstructured P2P networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• P systems with active membranes: Trading time for space
• Tissue P systems with cell separation: attacking the partition problem
• Membrane Computing
• Aspects of Molecular Computing
• Spiking neural P systems: an improved normal form

Cited In (2)

• Depth-first search with P systems
• Partial memoization for obtaining linear time behavior of a 2DPDA

Uses Software

• P-Lingua

This page was built for publication: A linear time complexity of breadth-first search using P system with membrane division

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q459939)