Fast distributed DFS solutions for edge-disjoint paths in digraphs

Authors:
Hossam ElGindy;Radu Nicolescu;Huiling Wu
Affiliations:
School of Computer Science and Engineering, University of New South Wales, Sydney, Australia;Department of Computer Science, University of Auckland, Auckland, New Zealand;Department of Computer Science, University of Auckland, Auckland, New Zealand
Venue:
CMC'12 Proceedings of the 13th international conference on Membrane Computing
Year:
2012

Citing 7
Cited 0

Yet another distributed depth-first-search algorithm

Information Processing Letters
Computing with membranes

Journal of Computer and System Sciences
Introduction to Distributed Algorithms

Introduction to Distributed Algorithms
The Oxford Handbook of Membrane Computing

The Oxford Handbook of Membrane Computing
A faster P solution for the Byzantine agreement problem

CMC'10 Proceedings of the 11th international conference on Membrane computing
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present two new synchronous distributed message-based depth-first search (DFS) based algorithms, Algorithms C and D, to compute a maximum cardinality set of edge-disjoint paths, between a source node and a target node in a digraph. We compare these new algorithms with our previous implementation of the classical algorithm, Algorithm A, and our previous improvement, Algorithm B [10]. Empirical results show that, on a set of random digraphs, our algorithms are faster than the classical Algorithm A, by a factor around 40%. All these improved algorithms have been inspired and guided by a P system modelling exercise, but are suitable for any distributed implementation. To achieve the maximum theoretical performance, our P systems specification uses high-level generic rules applied in matrix grammar mode.