Fast Distributed DFS Solutions for Edge-Disjoint Paths in Digraphs
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 . 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.
Keywordsedge-disjoint paths depth-first search network flow distributed systems P systems generic rules matrix grammars
Unable to display preview. Download preview PDF.
- 3.Dinneen, M.J., Kim, Y.B., Nicolescu, R.: Edge- and vertex-disjoint paths in P modules. In: Ciobanu, G., Koutny, M. (eds.) Workshop on Membrane Computing and Biologically Inspired Process Calculi, pp. 117–136 (2010)Google Scholar
- 7.Hagberg, A.A., Schult, D.A., Swart, P.J.: Exploring Network Structure, Dynamics, and Function using NetworkX. In: Varoquaux, G., Vaught, T., Millman, J. (eds.) 7th Python in Science Conference (SciPy), pp. 11–15 (2008)Google Scholar
- 8.Karp, R.M.: Reducibility Among Combinatorial Problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press (1972)Google Scholar
- 10.Nicolescu, R., Wu, H.: New solutions for disjoint paths in P systems. Natural Computing, 1–15 (2012), doi:10.1007/s11047-012-9342-9Google Scholar
- 13.Tel, G.: Introduction to Distributed Algorithms. Cambridge University Press (2000)Google Scholar