Pages that link to "Item:Q331973"
From MaRDI portal
The following pages link to Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs (Q331973):
Displaying 3 items.
- A distributed approximation algorithm for strongly connected dominating-absorbent sets in asymmetric wireless ad-hoc networks (Q1796438) (← links)
- Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks (Q2322692) (← links)
- On constructing strongly connected dominating and absorbing set in 3-dimensional wireless ad hoc networks (Q2658460) (← links)