A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Node and Edge Averaged Complexities of Local Graph Problems

2022
*
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing
*

We continue the recently started line of work on the distributed node-averaged complexity of distributed graph algorithms. The node-averaged complexity of a distributed algorithm running on a graph 𝐺 = (𝑉 , 𝐸) is the average over the times at which the nodes 𝑉 of 𝐺 finish their computation and commit to their outputs. We study the node-averaged complexity for some of the central distributed symmetry breaking problems. As our main result, we show that the randomized node-averaged complexity of

doi:10.1145/3519270.3538419
fatcat:xz4l2ozpgrfxzbxmspaadszd6e