A Linear Time Complexity of Breadth-First Search Using <i>P</i> System with Membrane Division

<table>An overview of proposed <svg height="11.175" id="M352" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 10.9375 11.175" width="10.9375" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.113)"><path d="M619 482q0 -69 -40.5 -119t-96 -72.5t-118.5 -26.5h-44l-70 20l-31 -151q-14 -67 0.5 -83t89.5 -22l-5 -28h-287l8 28q65 7 81.5 22t29.5 83l79 398q12 56 0.5 70.5t-78.5 20.5l7 28h255q108 0 164 -43t56 -125zM524 478q0 141 -146 141q-25 0 -47 -8q-16 -6 -20.5 -13.5
t-10.5 -39.5l-43 -241q37 -13 83 -13q67 0 125.5 45t58.5 129z" id="x1D443"></path></g>
</svg> system process for searching number 6.</table>

Mathematical Problems in Engineering

fig5

Figure 5

Figure 5: A Linear Time Complexity of Breadth-First Search Using <i>P</i> System with Membrane Division 

Mathematical Problems in Engineering

A Linear Time Complexity of Breadth-First Search Using P System with Membrane Division

Figure 5