Pages that link to "Item:Q652528"
From MaRDI portal
The following pages link to Tighter approximation bounds for minimum CDS in unit disk graphs (Q652528):
Displaying 4 items.
- An efficient connected dominating set algorithm in WSNS based on the induced tree of the crossed cube (Q747485) (← links)
- A better approximation for constructing virtual backbone in 3D wireless ad-hoc networks (Q896118) (← links)
- Making a dominating set of a graph connected (Q1656909) (← links)
- 2-edge connected dominating sets and 2-connected dominating sets of a graph (Q5963646) (← links)
