Opened Access BFS Solution for Disjoint Paths in P Systems
Estadísticas
Icon
Exportar a
Autor: Nicolescu, Radu
Wu, Huiling
Fecha: 2011
Publicado en: Proceedings of the Ninth Brainstorming Week on Membrane Computing, 265-285. Sevilla, E.T.S. de Ingeniería Informática, 31 de enero-4 de febrero, 2011
ISBN/ISSN: 9788461518371
Tipo de documento: Ponencia
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 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.
Tamaño: 274.3Kb
Formato: PDF

URI: http://hdl.handle.net/11441/39561

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones