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. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Nicolescu, R., & Wu, H. (2011). BFS solution for disjoint paths in P systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6714 LNCS, pp. 164–176). https://doi.org/10.1007/978-3-642-21341-0_20
Mendeley helps you to discover research relevant for your work.