Assertion: graph's information | /r/HasProperty | propagated to another side
Facets:
value: from one side of the network
type: TRANSITIVE-OBJECT
Source sentences:
text: A straightforward distributed version of the greedy algorithm for (Δ + 1)-coloring requires Θ(n) communication rounds in the worst case − information may need to be propagated from one side of the network to another side.