Daniel M. Bikel, Vittorio Castelli
ACL 2008
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
Oliver Bodemer
IBM J. Res. Dev
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
Frank R. Libsch, S.C. Lien
IBM J. Res. Dev