BFS solution for disjoint paths in P systems

Authors:
Radu Nicolescu;Huiling Wu
Affiliations:
Department of Computer Science, University of Auckland, Auckland, New Zealand;Department of Computer Science, University of Auckland, Auckland, New Zealand
Venue:
UC'11 Proceedings of the 10th international conference on Unconventional computation
Year:
2011

Citing 9
Cited 3

A new approach to the maximum-flow problem

Journal of the ACM (JACM)
The design and analysis of algorithms

The design and analysis of algorithms
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Journal of the ACM (JACM)
Computing with membranes

Journal of Computer and System Sciences
Distributed Algorithms

Distributed Algorithms
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Tissue P systems

Theoretical Computer Science
Disjoint-path routing: Efficient communication for streaming applications

IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Introduction to Algorithms, Third Edition

Introduction to Algorithms, Third Edition

Parallel and distributed algorithms in p systems

CMC'11 Proceedings of the 12th international conference on Membrane Computing
New solutions for disjoint paths in P systems

Natural Computing: an international journal
P System Implementation of Dynamic Programming Stereo

Journal of Mathematical Imaging and Vision

Quantified Score

Hi-index	0.00

Visualization

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. With reference to the previously proposed solution [3], based on depth-first search (DFS), we propose a faster solution, based on breadth-first 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.