English: Let G be a graph with maximum node degree $\Delta$. Show that there exists an algorithm that computes a BFS tree from each node up to depth d in $O(d + \Delta^d)$ rounds. Remark: You are allowed to give a randomized algorithm at the cost of an extra $(log_n)$-factor in the running time. However, we believe that the most straightforward solution uses a deterministic algorithm.
Anyone has idea how to solve this Problem? And can give maybe some advice to me. Because i spend already more days on this question, but actually i dont have any approach to this exercises...