Thomas M. Cover
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
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum
Rolf Clauberg
IBM J. Res. Dev
Conference paper
COUNTERFACTUAL CONCEPT BOTTLENECK MODELS
Gabriele Dominici, Pietro Barbiero, et al.
ICLR 2025