Finding the diameter of a tree with distance queries

Dániel Gerbner, András Imolay, Kartal Nagy +2

We study the number of distance queries needed to identify certain properties of a hidden tree $T$ on $n$ vertices. A distance query consists of two vertices $x,y$, and the answer…