Depth-first search with P systems

DOI10.1007/978-3-642-18123-8_20MaRDI QIDQ3067495zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Searching and sorting (68P10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Combinatorics in computer science (68R05)

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

Cited in

(9)

• Relational depth-first-search with applications
• 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
• Accelerated execution of P systems with active membranes to solve the N-queens problem
• scientific article; zbMATH DE number 1069483 (Why is no real title available?)
• A linear time complexity of breadth-first search using P system with membrane division
• A linear time solution for N-queens problem using generalized networks of evolutionary polarized processors
• The principle of selecten jumping searching and \(C,C_ 0',C^*\) algorithms

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)