Distributed distance-r covering problems on sparse high-girth graphs
From MaRDI portal
(Redirected from Publication:5925671)
Distributed distance-\(r\) covering problems on sparse high-girth graphs (scientific article; zbMATH DE number 7667120)
Distributed distance-\(r\) covering problems on sparse high-girth graphs (scientific article; zbMATH DE number 7667120)
Cites work
- A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds
- A log-star distributed maximal independent set algorithm for growth-bounded graphs
- Approximation algorithms for NP-complete problems on planar graphs
- Deterministic distributed dominating set approximation in the CONGEST model
- Distributed Approximation Algorithms for Planar Graphs
- Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs
- Distributed Approximation on Power Graphs
- Distributed Computing: A Locality-Sensitive Approach
- Distributed Maximal Independent Set using Small Messages
- Distributed minimum dominating set approximations in restricted families of graphs
- Fast Distributed Approximations in Planar Graphs
- Fast network decomposition
- Graph theory
- Hardness of Distributed Optimization
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- Local computation: lower and upper bounds
- Locality in Distributed Graph Algorithms
- Minimum dominating set approximation in graphs of bounded arboricity
- On sparse spanners of weighted graphs
- Polylogarithmic-time deterministic network decomposition and distributed derandomization
- Sparsity. Graphs, structures, and algorithms
- What can be computed locally?
Cited in
(2)
This page was built for publication: Distributed distance-\(r\) covering problems on sparse high-girth graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5925671)
