Repositorio de producción científica de la Universidad de Sevilla

BFS Solution for Disjoint Paths in P Systems

 

Advanced Search
 
Opened Access BFS Solution for Disjoint Paths in P Systems
Cites
Show item statistics
Icon
Export to
Author: Nicolescu, Radu
Wu, Huiling
Date: 2011
Published in: 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
Document type: Presentation
Abstract: 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.
Size: 274.3Kb
Format: PDF

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

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)