Local mending
From MaRDI portal
Publication:2097329
DOI10.1007/978-3-031-09993-9_1OpenAlexW4285218845MaRDI QIDQ2097329
Joel Rybicki, Juho Hirvonen, Jukka Suomela, Darya Melnyk, Dennis Olivetti, Alkida Balliu
Publication date: 11 November 2022
Full work available at URL: https://arxiv.org/abs/2102.08703
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast distributed network decompositions and covers
- Local stabilizer
- Constructing labeling schemes through universal matrices
- Finitary coloring
- The local nature of \(\Delta\)-coloring and its algorithmic applications
- Fault-containing self-stabilizing distributed protocols
- Distributed verification of minimum spanning trees
- Local mending
- Distributed graph problems through an automata-theoretic Lens
- Locality of not-so-weak coloring
- Distributed coloring in sparse graphs with fewer colors
- Proof labeling schemes
- Locally checkable proofs
- Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic, and Faulty Networks
- Total domination in graphs
- Locality in Distributed Graph Algorithms
- Self-stabilizing systems in spite of distributed control
- Fault-Local Distributed Mending
- Tight Fault Locality
- Distributed Computing: A Locality-Sensitive Approach
- A Time Hierarchy Theorem for the LOCAL Model
- What Can be Computed Locally?
- Distributed Graph Coloring: Fundamentals and Recent Developments
- The State of the Art in Dynamic Graph Algorithms
- New classes of distributed time complexity
- Optimal Distributed Coloring Algorithms for Planar Graphs in the LOCAL model
- A lower bound for the distributed Lovász local lemma
- Brief Announcement
- LCL Problems on Grids
- The Local Nature of List Colorings for Graphs of High Girth
This page was built for publication: Local mending
