Mostrar el registro sencillo del ítem

Ponencia

dc.creatorNicolescu, Radues
dc.creatorWu, Huilinges
dc.date.accessioned2016-04-06T09:18:52Z
dc.date.available2016-04-06T09:18:52Z
dc.date.issued2011
dc.identifier.isbn9788461518371es
dc.identifier.urihttp://hdl.handle.net/11441/39561
dc.description.abstractThis 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.formatapplication/pdfes
dc.language.isoenges
dc.publisherFénix Editoraes
dc.relation.ispartofProceedings 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, 2011es
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.titleBFS Solution for Disjoint Paths in P Systemses
dc.typeinfo:eu-repo/semantics/conferenceObjectes
dc.type.versioninfo:eu-repo/semantics/publishedVersiones
dc.rights.accessRightsinfo:eu-repo/semantics/openAccess
dc.identifier.idushttps://idus.us.es/xmlui/handle/11441/39561

FicherosTamañoFormatoVerDescripción
18disjoint_paths_BFS.pdf274.3KbIcon   [PDF] Ver/Abrir  

Este registro aparece en las siguientes colecciones

Mostrar el registro sencillo del ítem

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Excepto si se señala otra cosa, la licencia del ítem se describe como: Attribution-NonCommercial-NoDerivatives 4.0 Internacional