Depth-first search with P systems
From MaRDI portal
Publication:3067495
DOI10.1007/978-3-642-18123-8_20zbMATH Open1259.68043OpenAlexW1517760668MaRDI QIDQ3067495FDOQ3067495
Authors: Miguel A. Gutiérrez-Naranjo, Mario J. Pérez-Jiménez
Publication date: 21 January 2011
Published in: Membrane Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-18123-8_20
Recommendations
- P systems with active membranes: Attacking NP-complete problems
- scientific article; zbMATH DE number 1583871
- A linear time complexity of breadth-first search using P system with membrane division
- Solving the \(N\)-Queens puzzle by using few membranes
- Accelerated execution of P systems with active membranes to solve the \(N\)-queens problem
Combinatorics in computer science (68R05) Searching and sorting (68P10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cited In (9)
- Accelerated execution of P systems with active membranes to solve the \(N\)-queens problem
- A linear time solution for \(N\)-queens problem using generalized networks of evolutionary polarized processors
- Solving the N-queens problem using dP systems with active membranes
- Solving the \(N\)-Queens puzzle by using few membranes
- Depth-First Search Using $$O(n)$$ Bits
- A linear time complexity of breadth-first search using P system with membrane division
- Title not available (Why is that?)
- The principle of selecten jumping searching and \(C,C_ 0',C^*\) algorithms
- Relational depth-first-search with applications
This page was built for publication: Depth-first search with P systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3067495)