Abstract:
This paper continues the research on determining a maximum cardinality set of
edge- and node-disjoint paths between a source cell and a target cell in P systems.
We review the previous solution [DKN10], based on depth- rst search (DFS), and
we propose a faster solution, based on breadth- rst search (BFS), which leverages
the parallel and distributed characteristics of P systems. The runtime complexity
shows that, our BFS-based solution performs better than the DFS-based solution,
in terms of P steps.