Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory
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
Robert E. Donovan
INTERSPEECH - Eurospeech 2001
Conference paper
Global routing revisited
Michael D. Moffitt
ICCAD 2009
Nanda Kambhatla
ACL 2004