Pages that link to "Item:Q537633"
From MaRDI portal
The following pages link to On connected domination in unit ball graphs (Q537633):
Displaying 19 items.
- Connected dominating set. Theory and applications (Q436191) (← links)
- Constrained surface-level gateway placement for underwater acoustic wireless sensor networks (Q443720) (← links)
- A better approximation for constructing virtual backbone in 3D wireless ad-hoc networks (Q896118) (← links)
- A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks (Q1037372) (← links)
- Approximation algorithms for connected dominating sets (Q1386346) (← links)
- Bounds on the domination number of a digraph (Q1698058) (← links)
- A distributed approximation algorithm for the bottleneck connected dominating set problem (Q1926605) (← links)
- Wireless networking, dominating and packing (Q1958633) (← links)
- On approximation of dominating tree in wireless sensor networks (Q1958639) (← links)
- Approximation algorithm for a generalized Roman domination problem in unit ball graphs (Q2292134) (← links)
- On connected dominating sets of restricted diameter (Q2356248) (← links)
- On dominating sets whose induced subgraphs have a bounded diameter (Q2444556) (← links)
- On constructing strongly connected dominating and absorbing set in 3-dimensional wireless ad hoc networks (Q2658460) (← links)
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks (Q4446911) (← links)
- (Q4642186) (← links)
- Linear separation of connected dominating sets in graphs (Q5225055) (← links)
- A survey on variant domination problems in geometric intersection graphs (Q6536206) (← links)
- Online dominating set and coloring (Q6606165) (← links)
- The algorithm and complexity of co-secure domination in geometric intersection graphs (Q6653927) (← links)
