Pages that link to "Item:Q4471362"
From MaRDI portal
The following pages link to Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons (Q4471362):
Displaying 10 items.
- Constructing weakly connected dominating set for secure clustering in distributed sensor network (Q421263) (← links)
- Bounds relating the weakly connected domination number to the total domination number and the matching number (Q967362) (← links)
- A self-stabilizing algorithm for constructing weakly connected minimal dominating sets (Q989481) (← links)
- Connected domination of regular graphs (Q1025488) (← links)
- Revisiting connected dominating sets: an almost optimal local information algorithm (Q2414868) (← links)
- Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons (Q2575833) (← links)
- Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems (Q5210996) (← links)
- Approximation algorithms for channel allocation problems in broadcast networks (Q5487810) (← links)
- Distributed algorithms for ultrasparse spanners and linear size skeletons (Q5892001) (← links)
- Constant-time distributed dominating set approximation (Q5917933) (← links)