Salehi, Einallah and Shamsuddin, Siti Mariyam and Nemati, Kourosh (2013) A linear time complexity of breadthfirst search using P system with membrane division. Mathematical Problems In Engineering, 2013 . ISSN 1024123X

PDF
2MB 
Official URL: http://dx.doi.org/10.1155/2013/424108
Abstract
One of the known methods for solving the problems with exponential time complexity such as NPcomplete 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 to find a solution for the problems with exponential time complexity with Membrane Computing techniques is by P System with active membrane using division rule. It makes an exponential workspace and solves the problems with exponential complexity in a polynomial (even linear) time. On the other hand, searching is currently one of the most used methods for finding solution for problems in real life, that the blind search algorithms are accurate, but their time complexity is exponential such as breadthfirst search (BFS) algorithm. In this paper, we proposed a new approach for implementation of BFS by using P system with division rule technique for first time. The theorem shows time complexity of BSF in this framework on randomly binary trees reduced from O (2 d) to O (d)
Item Type:  Article 

Uncontrolled Keywords:  algorithms, binary trees, bioinformatics, computational complexity 
Subjects:  Q Science > QA Mathematics > QA76 Computer software 
Divisions:  Computing 
ID Code:  48994 
Deposited By:  Siti Nor Hashidah Zakaria 
Deposited On:  02 Dec 2015 02:10 
Last Modified:  14 Oct 2018 08:21 
Repository Staff Only: item control page