BFS Solution for Disjoint Paths in P Systems

Nicolescu, R.; Wu, H.

dc.contributor.author	Nicolescu, R.	en
dc.contributor.author	Wu, H.	en
dc.date.accessioned	2012-01-16T03:19:43Z	en
dc.date.available	2012-01-16T03:19:43Z	en
dc.date.issued	2011	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-399 (2011)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/10552	en
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 [DKN10], based on depth- rst search (DFS), and we propose a faster solution, based on breadth- 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.	en
dc.publisher	Department of Computer Science, The University of Auckland, New Zealand	en
dc.relation.ispartofseries	CDMTCS Research Report Series	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.source.uri	http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial	en
dc.title	BFS Solution for Disjoint Paths in P Systems	en
dc.type	Technical Report	en
dc.subject.marsden	Fields of Research::280000 Information, Computing and Communication Sciences	en
dc.rights.holder	The author(s)	en
dc.rights.accessrights	http://purl.org/eprint/accessRights/OpenAccess	en