Ponencia
BFS Solution for Disjoint Paths in P Systems
Autor/es | Nicolescu, Radu
Wu, Huiling |
Fecha de publicación | 2011 |
Fecha de depósito | 2016-04-06 |
Publicado en |
|
ISBN/ISSN | 9788461518371 |
Resumen | 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 ... 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. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
18disjoint_paths_BFS.pdf | 274.3Kb | [PDF] | Ver/ | |