M.F. Cowlishaw
IBM Systems Journal
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
Raymond F. Boyce, Donald D. Chamberlin, et al.
CACM
Reena Elangovan, Shubham Jain, et al.
ACM TODAES
Thomas M. Cover
IEEE Trans. Inf. Theory