Yet another distributed depth-first-search algorithm
Information Processing Letters
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)
Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout
SIAM Journal on Computing
Journal of Computer and System Sciences
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
Distributed Algorithms
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
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
BFS solution for disjoint paths in P systems
UC'11 Proceedings of the 10th international conference on Unconventional computation
Constructing disjoint paths for failure recovery and multipath routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fast distributed DFS solutions for edge-disjoint paths in digraphs
CMC'12 Proceedings of the 13th international conference on Membrane Computing
| Hi-index | 0.00 |
We propose four fast synchronous distributed message-based algorithms, to identify maximum cardinality sets of edge- and node-disjoint paths, between a source node and a target node in a digraph. Previously, Dinneen et al. presented two algorithms, based on the classical distributed depth-first search (DFS), which run in O(mf) steps, where m is the number of edges and f is the number of disjoint paths. Combining Cidon's distributed DFS and our new result, Theorem 3, we propose two improved DFS-based algorithms, which run in O(nf) steps, where n is the number of nodes. We also present improved versions of our two breadth-first search (BFS) based algorithms, with the same complexity upperbound, O(nf). Empirically, for a large set of randomly generated digraphs, our DFS-based edge-disjoint algorithm is 39 % faster than Dinneen et al.'s edge-disjoint algorithm and our BFS-based edge-disjoint algorithm is 80 % faster. All these improved algorithms have been inspired and guided by a P system modelling exercise, but are suitable for any distributed implementation.