Pages that link to "Item:Q2507113"

The following pages link to On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks (Q2507113):

Displaying 33 items.

• A greedy algorithm for the fault-tolerant connected dominating set in a general graph (Q405692) (← links)
• Constructing weakly connected dominating set for secure clustering in distributed sensor network (Q421263) (← links)
• Efficient transformation of distance-2 self-stabilizing algorithms (Q433436) (← links)
• On the construction of \(k\)-connected \(m\)-dominating sets in wireless networks (Q434202) (← links)
• A note on \(\alpha\)-total domination in cubic graphs (Q516909) (← links)
• Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks (Q663430) (← links)
• An efficient connected dominating set algorithm in WSNS based on the induced tree of the crossed cube (Q747485) (← links)
• Upper signed \(k\)-domination in a general graph (Q765509) (← links)
• Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs (Q837173) (← links)
• Upper bounds for \(\alpha \)-domination parameters (Q844230) (← links)
• Construction of strongly connected dominating sets in asymmetric multihop wireless networks (Q1006037) (← links)
• On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs (Q1016039) (← links)
• On approximating (connected) 2-edge dominating set by a tree (Q1635808) (← links)
• Approximation algorithms for highly connected multi-dominating sets in unit disk graphs (Q1755744) (← links)
• Uncertain weighted dominating set: a prototype application on natural disaster relief management (Q1797772) (← links)
• A distributed approximation algorithm for the bottleneck connected dominating set problem (Q1926605) (← links)
• A greedy algorithm for the fault-tolerant outer-connected dominating set problem (Q2025101) (← links)
• Routing-efficient CDS construction in disk-containment graphs (Q2448125) (← links)
• Energy conservation in wireless sensor networks and connectivity of graphs (Q2481953) (← links)
• Construction of minimum edge-fault tolerant connected dominating set in a general graph (Q2698012) (← links)
• 2-(edge-)connected edge domination number and matching number (Q2698534) (← links)
• (Q3175799) (← links)
• Finding Totally Independent Spanning Trees with Linear Integer Programming (Q3195324) (← links)
• MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS (Q3634203) (← links)
• Independent domination in directed graphs (Q4957541) (← links)
• Independent strong domination in complementary prisms (Q4957962) (← links)
• A matheuristic approach for solving the 2-connected dominating set problem (Q4989008) (← links)
• Computing Minimum <i>k</i>-Connected <i>m</i>-Fold Dominating Set in General Graphs (Q5131721) (← links)
• Breaking the <i>O</i>(ln <i>n</i>) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set (Q5131722) (← links)
• MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS (Q5696910) (← links)
• On Approximating (Connected) 2-Edge Dominating Set by a Tree (Q5740184) (← links)
• Independent strong weak domination: A mathematical programming approach (Q5858171) (← links)
• A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem (Q5963614) (← links)