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

M.J. Slattery, Joan L. Mitchell

IBM J. Res. Dev