Tight Lower Bounds in the Supported LOCAL Model
Abstract
References
Index Terms
- Tight Lower Bounds in the Supported LOCAL Model
Recommendations
Node and Edge Averaged Complexities of Local Graph Problems
PODC'22: Proceedings of the 2022 ACM Symposium on Principles of Distributed ComputingWe 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 G=(V,E) is the average over the times at which the ...
Distributed Lower Bounds for Ruling Sets
Given a graph $G=(V,E)$, an $(\alpha,\beta)$-ruling set is a subset $S\subseteq V$ such that the distance between any two vertices in $S$ is at least $\alpha$, and the distance between any vertex in $V$ and the closest vertex in $S$ is at most $\beta$. We ...
Distributed ∆-coloring plays hide-and-seek
STOC 2022: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of ComputingWe prove several new tight or near-tight distributed lower bounds for classic symmetry breaking problems in graphs. As a basic tool, we first provide a new insightful proof that any deterministic distributed algorithm that computes a Δ-coloring on Δ-...
Comments
Information & Contributors
Information
Published In
![cover image ACM Conferences](/cms/asset/5698c1ae-7829-453d-9fe1-455a80a8717e/3662158.cover.jpg)
- Chair:
- Ran Gelles,
- Proceedings Chair:
- Dennis Olivetti,
- Program Chair:
- Petr Kuznetsov
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- MUR (Italy)
- PNRR MIUR
- MUR
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 21Total Downloads
- Downloads (Last 12 months)21
- Downloads (Last 6 weeks)12
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in