Mika Göös · Juho Hirvonen · Jukka Suomela

Linear-in-Δ lower bounds in the LOCAL model

Distributed Computing · to appear · doi:10.1007/s00446-015-0245-8

authors’ version publisher’s version arXiv.org

Abstract

By prior work, there is a distributed graph algorithm that finds a maximal fractional matching (maximal edge packing) in $O(\Delta)$ rounds, independently of $n$; here $\Delta$ is the maximum degree of the graph and $n$ is the number of nodes in the graph. We show that this is optimal: there is no distributed algorithm that finds a maximal fractional matching in $o(\Delta)$ rounds, independently of $n$. Our work gives the first linear-in-$\Delta$ lower bound for a natural graph problem in the standard LOCAL model of distributed computing—prior lower bounds for a wide range of graph problems have been at best logarithmic in $\Delta$.

Links

Conference Version

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author’s copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.