A linear time complexity of breadth-first search using P system with membrane division
From MaRDI portal
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; zbMATH DE number 1583885
- Solution to PSPACE-complete problem using P systems with active membranes with time-freeness
Cites work
- scientific article; zbMATH DE number 1583879 (Why is no real title available?)
- scientific article; zbMATH DE number 1738669 (Why is no real title available?)
- scientific article; zbMATH DE number 2118901 (Why is no real title available?)
- scientific article; zbMATH DE number 783783 (Why is no real title available?)
- A tissue P systems based uniform solution to tripartite matching problem
- A uniform family of tissue P systems with cell division solving 3-COL in a linear time
- Aspects of Molecular Computing
- BFS Solution for Disjoint Paths in P Systems
- Computational complexity of tissue-like P systems
- Computing with membranes
- Depth-first search with P systems
- Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
- FACC: a novel finite automaton based on cloud computing for the multiple longest common subsequences search
- Improved degree search algorithms in unstructured P2P networks
- Membrane Computing
- Membrane Computing
- Merged search algorithms for radio frequency identification anticollision
- New solutions for disjoint paths in P systems
- On the power of membrane division in P systems
- P systems with active membranes: Attacking NP-complete problems
- P systems with active membranes: Trading time for space
- Smaller universal spiking neural P systems
- Solving HPP and SAT by P systems with active membranes and separation rules
- Spiking neural P systems
- Spiking neural P systems with neuron division and budding
- Spiking neural P systems: an improved normal form
- The computational power of cell division in P systems: Beating down parallel computers?
- Time-free spiking neural P systems
- Tissue P systems with cell separation: attacking the partition problem
- Tissue P systems.
- Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs
Cited in
(2)
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)
