Drucker, Kuhn, and Oshman [1]} study the complexity of finding trees and complete bipartite subgraphs in the \(\mathsf {BROADCAST~CONGESTED~CLIQUE}\)  model. Korhonen and Rybicki [2]} show that trees can be detected in \(O(1)\)  rounds in the \(\mathsf {BROADCAST~CONGEST}\)  model.
