Distributed backup placement
From MaRDI portal
Publication:2084982
DOI10.1007/s00446-022-00423-zOpenAlexW4220898739MaRDI QIDQ2084982
Publication date: 14 October 2022
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-022-00423-z
Cites Work
- Unnamed Item
- Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
- Distributed backup placement in networks
- Improved deterministic distributed matching via rounding
- A log-star distributed maximal independent set algorithm for growth-bounded graphs
- Edge-Disjoint Spanning Trees of Finite Graphs
- Locality in Distributed Graph Algorithms
- Self-stabilizing systems in spite of distributed control
- On the Complexity of Distributed Network Decomposition
- Distributed 2-Approximation Algorithm for the Semi-matching Problem
- Distributed Graph Coloring: Fundamentals and Recent Developments
- When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time
- Some simple distributed algorithms for sparse networks
- Faster Deterministic Distributed Coloring Through Recursive List Coloring
- Coloring unstructured wireless multi-hop networks
- Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity
- Deterministic Distributed Vertex Coloring in Polylogarithmic Time
- A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs
- What cannot be computed locally!
- Decomposition of Finite Graphs Into Forests
- Self-stabilization and Byzantine tolerance for maximal matching
This page was built for publication: Distributed backup placement