Published April 6, 2016 | Version v1
Publication

BFS Solution for Disjoint Paths in P Systems

Description

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, based on depth-fi rst search (DFS), and we propose a faster solution, based on breadth-fi 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.

Additional details

Identifiers

URL
https://idus.us.es/handle/11441/39561
URN
urn:oai:idus.us.es:11441/39561