Recognizing Label-Connected GraphsResearch Paper
In the classical gossiping problem every participant holds one piece of information, and whenever two participants call each other they exchange everything they know. With all pairs allowed to call, calls are necessary and sufficient for participants (Baker–Shostak 1972; Hajnal–Milner–Szemerédi 1972). When the available calls are prescribed…