A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
We present a randomized algorithm for reconstructing directed rooted trees of n nodes and node degree at most d, by asking at most O(dn^2 n) path queries. Each path query takes as input an origin node and a target node, and answers whether there is a directed path from the origin to the target. Regarding lower bounds, we show that any randomized algorithm requires at least Ω(n n) queries, while any deterministic algorithm requires at least Ω(dn) queries. Additionally, we present a O(dn^3 n)arXiv:1606.05183v3 fatcat:thzx62zvcfaszceuf5l25zedhe