Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
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
Nanda Kambhatla
ACL 2004
Conference paper
Some experimental results on placement techniques
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976
Liat Ein-Dor, Y. Goldschmidt, et al.
IBM J. Res. Dev