S.M. Sadjadi, S. Chen, et al.
TAPIA 2009
Paper
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. © 1985.
Related
Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004
Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking