Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking
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
Frank R. Libsch, S.C. Lien
IBM J. Res. Dev
Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006
G. Ramalingam
Theoretical Computer Science