Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
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
Conference paper
Association control in mobile wireless networks
Minkyong Kim, Zhen Liu, et al.
INFOCOM 2008
Arun Viswanathan, Nancy Feldman, et al.
IEEE Communications Magazine
Ziyang Liu, Sivaramakrishnan Natarajan, et al.
VLDB