Conference paper
Performance measurement and data base design
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975
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
David A. Selby
IBM J. Res. Dev
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking
Raymond F. Boyce, Donald D. Chamberlin, et al.
CACM