
The authors develop a deterministic round elimination framework to prove tight lower bounds for fundamental distributed graph problems in the Supported LOCAL model, including maximal matching, maximal independent set, ruling sets, arbdefective colorings, and generalizations thereof.


coremsg

tight-lower-bounds-for-fundamental-distributed-graph-problems-in-the-supported-local-model


Tight Lower Bounds for Fundamental Distributed Graph Problems in the Supported LOCAL Model
