BFS Solution for Disjoint Paths in P Systems

摘要

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. With reference to the previously proposed solution [3], based on depth-first search (DFS), we propose a faster solution, based on breadth-first 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.