Victor Valls, Panagiotis Promponas, et al.
IEEE Communications Magazine
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
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
John M. Boyer, Charles F. Wiecha
DocEng 2009
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science