Pages that link to "Item:Q3634203"
From MaRDI portal
The following pages link to MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS (Q3634203):
Displaying 15 items.
- Improved linear problem kernel for planar connected dominating set (Q392013) (← links)
- A greedy algorithm for the fault-tolerant connected dominating set in a general graph (Q405692) (← links)
- New dominating sets in social networks (Q604953) (← links)
- Fault-tolerant routing: \(k\)-inconnected many-to-one routing in wireless networks (Q621838) (← links)
- On positive influence dominating sets in social networks (Q621845) (← links)
- Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks (Q663430) (← links)
- Approximating minimum independent dominating sets in wireless networks (Q975555) (← links)
- Construction of strongly connected dominating sets in asymmetric multihop wireless networks (Q1006037) (← links)
- Approximation algorithms for connected dominating sets (Q1386346) (← links)
- Two algorithms for minimum 2-connected \(r\)-hop dominating set (Q1675775) (← links)
- Wireless networking, dominating and packing (Q1958633) (← links)
- TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET (Q5189988) (← links)
- MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS (Q5696910) (← links)
- A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem (Q5963614) (← links)
- Progress on fault-tolerant locating-dominating sets (Q6174163) (← links)
