Mostrar el registro sencillo del ítem
Ponencia
BFS Solution for Disjoint Paths in P Systems
dc.creator | Nicolescu, Radu | es |
dc.creator | Wu, Huiling | es |
dc.date.accessioned | 2016-04-06T09:18:52Z | |
dc.date.available | 2016-04-06T09:18:52Z | |
dc.date.issued | 2011 | |
dc.identifier.isbn | 9788461518371 | es |
dc.identifier.uri | http://hdl.handle.net/11441/39561 | |
dc.description.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. | es |
dc.format | application/pdf | es |
dc.language.iso | eng | es |
dc.publisher | Fénix Editora | es |
dc.relation.ispartof | 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 | es |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.title | BFS Solution for Disjoint Paths in P Systems | es |
dc.type | info:eu-repo/semantics/conferenceObject | es |
dc.type.version | info:eu-repo/semantics/publishedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | |
dc.identifier.idus | https://idus.us.es/xmlui/handle/11441/39561 |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
18disjoint_paths_BFS.pdf | 274.3Kb | [PDF] | Ver/ | |