A linear time complexity of breadth-first search using P system with membrane division
From MaRDI portal
Publication:459939
DOI10.1155/2013/424108zbMath1296.68052OpenAlexW1996709931WikidataQ59027413 ScholiaQ59027413MaRDI QIDQ459939
Einallah Salehi, Kourosh Nemati, Siti Mariyam Hj. 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New solutions for disjoint paths in P systems
- Spiking neural P systems with neuron division and budding
- P systems with active membranes: Trading time for space
- Tissue P systems with cell separation: attacking the partition problem
- Spiking neural P systems: an improved normal form
- 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
- Computational complexity of tissue-like P systems
- Tissue P systems.
- The computational power of cell division in P systems: Beating down parallel computers?
- Computing with membranes
- 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
- Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs
- Solving HPP and SAT by P systems with active membranes and separation rules
- A Tissue P Systems Based Uniform Solution to Tripartite Matching Problem
- BFS Solution for Disjoint Paths in P Systems
- Time-Free Spiking Neural P Systems
- Depth-First Search with P Systems
- Membrane Computing
- Aspects of Molecular Computing
- Membrane Computing
This page was built for publication: A linear time complexity of breadth-first search using P system with membrane division
