György E. Révész
Theoretical Computer Science
Paper
Yet another distributed depth-first-search algorithm
Abstract
A new distributed depth-first-search algorithm is presented whose communication and time complexities are bounded by 3|E| and 2|V|, respectively. © 1988.
Related
Quinn Pham, Danila Seliayeu, et al.
CASCON 2024
Bowen Zhou, Bing Xiang, et al.
SSST 2008
Lixi Zhou, Jiaqing Chen, et al.
VLDB