Consider an n-vertex graph G = (V, E) of maximum degree ?, and suppose that each vertex v ? V hosts a processor. The processors are allowed to communicate only with their neighbors in G. ... expand