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

• Main Authors: Salehi, Einallah, Shamsuddin, Siti Mariyam, Nemati, Kourosh
• Format: Article
• Language: English
• Published: Hindawi Publishing Corporation 2013
• Subjects: QA76 Computer software
• Online Access: http://eprints.utm.my/id/eprint/48994/1/SitiMariyamShamsuddin2013_Alineartimecomplexity.pdf; http://eprints.utm.my/id/eprint/48994/; http://dx.doi.org/10.1155/2013/424108
• Institution: Universiti Teknologi Malaysia

One of the known methods for solving the problems with exponential time complexity such as NP-complete problems is using the brute force algorithms. Recently, a new parallel computational framework called Membrane Computing is introduced which can be applied in brute force algorithms. The usual way...