Pages that link to "Item:Q5176213"
From MaRDI portal
The following pages link to Distributed algorithms for edge dominating sets (Q5176213):
Displaying 8 items.
- Distributed approximation of capacitated dominating sets (Q613113) (← links)
- Analysing local algorithms in location-aware quasi-unit-disk graphs (Q642985) (← links)
- Improved deterministic distributed matching via rounding (Q2189173) (← links)
- Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers (Q2803828) (← links)
- Exact Bounds for Distributed Graph Colouring (Q3460706) (← links)
- Distributed Dominating Set Approximations beyond Planar Graphs (Q4972685) (← links)
- AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY (Q5483379) (← links)
- Weak models of distributed computing, with connections to modal logic (Q5918244) (← links)