Preeti Malakar, Thomas George, et al.
SC 2012
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
Zohar Feldman, Avishai Mandelbaum
WSC 2010
S. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005
Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University