Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
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
Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006
Zohar Feldman, Avishai Mandelbaum
WSC 2010
Kaoutar El Maghraoui, Gokul Kandiraju, et al.
WOSP/SIPEW 2010