A New Distributed Depth-First-Search Algorithm

Abstract This paper presents a new distributed Depth-First-Search (DFS) algorithm for an asynchronous communication network, whose communication and time complexities are O(|E|) and O(|V|), respectively. The output of the algorithm is the DFS tree, kept in a distributed fashion. The existing algorithm, due to Cheung (1983), requires O(|E|) both in communication and time complexities.

[1]  Ernest J. H. Chang,et al.  Echo Algorithms: Depth Parallel Operations on General Graphs , 1982, IEEE Transactions on Software Engineering.

[2]  To-Yat Cheung,et al.  Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation , 1983, IEEE Transactions on Software Engineering.

[3]  Denise Marie Eckstein.  Parallel graph processing using depth-first search and breadth-first search. , 1977 .

[4]  Shimon Even,et al.  Graph Algorithms , 1979 .

[5]  Derek G. Corneil,et al.  Parallel computations in graph theory , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).