Pages that link to "Item:Q5145186"
From MaRDI portal
The following pages link to Deterministic Distributed Dominating Set Approximation in the CONGEST Model (Q5145186):
Displaying 14 items.
- Distributed approximation of capacitated dominating sets (Q613113) (← links)
- Distributed \(\mathcal{CONGEST}_{B C}\) constant approximation of MDS in bounded genus graphs (Q1711828) (← links)
- Deterministic distributed ruling sets of line graphs (Q1713911) (← links)
- Revisiting connected dominating sets: an almost optimal local information algorithm (Q2414868) (← links)
- Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph (Q2674709) (← links)
- Distributed Dominating Set Approximations beyond Planar Graphs (Q4972685) (← links)
- Network Decomposition and Distributed Derandomization (Invited Paper) (Q5100942) (← links)
- Constant-time distributed dominating set approximation (Q5917933) (← links)
- Distributed distance-\(r\) covering problems on sparse high-girth graphs (Q5918492) (← links)
- Distributed distance-\(r\) covering problems on sparse high-girth graphs (Q5925671) (← links)
- Deterministic Massively Parallel Connectivity (Q6069413) (← links)
- Improved hardness of approximation of diameter in the CONGEST model (Q6535016) (← links)
- Coloring fast without learning your neighbors' colors (Q6535038) (← links)
- Near-optimal distributed dominating set in bounded arboricity graphs (Q6658821) (← links)
