Pages that link to "Item:Q1006037"
From MaRDI portal
The following pages link to Construction of strongly connected dominating sets in asymmetric multihop wireless networks (Q1006037):
Displaying 12 items.
- Complexity of the maximum leaf spanning tree problem on planar and regular graphs (Q264582) (← links)
- Strong minimum energy hierarchical topology in wireless sensor networks (Q328707) (← links)
- Minimum energy multicast/broadcast routing with reception cost in wireless sensor networks (Q391238) (← links)
- On the \((h,k)\)-domination numbers of iterated line digraphs (Q444453) (← links)
- Finding minimum weight connected dominating set in stochastic graph based on learning automata (Q712488) (← links)
- Connected \(k\)-tuple twin domination in de Bruijn and Kautz digraphs (Q1045016) (← links)
- Domination parameters of a graph and its complement (Q1692643) (← links)
- 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)
- Bounds on the connected domination number of a graph (Q2446883) (← links)
- On constructing strongly connected dominating and absorbing set in 3-dimensional wireless ad hoc networks (Q2658460) (← links)
- The Optimal Design of Low-Latency Virtual Backbones (Q5148180) (← links)
