Pages that link to "Item:Q434202"
From MaRDI portal
The following pages link to On the construction of \(k\)-connected \(m\)-dominating sets in wireless networks (Q434202):
Displaying 17 items.
- A greedy algorithm for the fault-tolerant connected dominating set in a general graph (Q405692) (← links)
- Fault-tolerant routing: \(k\)-inconnected many-to-one routing in wireless networks (Q621838) (← links)
- An efficient connected dominating set algorithm in WSNS based on the induced tree of the crossed cube (Q747485) (← links)
- Approximating minimum independent dominating sets in wireless networks (Q975555) (← links)
- Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem (Q995580) (← links)
- Construction of strongly connected dominating sets in asymmetric multihop wireless networks (Q1006037) (← links)
- A distributed approximation algorithm for the bottleneck connected dominating set problem (Q1926605) (← links)
- Tractable connected domination for restricted bipartite graphs (Q2354310) (← links)
- Routing-efficient CDS construction in disk-containment graphs (Q2448125) (← links)
- On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs (Q2456357) (← links)
- On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks (Q2507113) (← links)
- Construction of minimum edge-fault tolerant connected dominating set in a general graph (Q2698012) (← links)
- MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS (Q3634203) (← links)
- A matheuristic approach for solving the 2-connected dominating set problem (Q4989008) (← links)
- Partial domination - the isolation number of a graph (Q5162046) (← 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)
