Learning a hidden graph using \(O(\log n)\)queries per edge
scientific article; zbMATH DE number 5285948