Zohar Feldman, Avishai Mandelbaum
WSC 2010
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
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
Elliot Linzer, M. Vetterli
Computing
Fan Zhang, Junwei Cao, et al.
IEEE TETC