Pages that link to "Item:Q883274"
From MaRDI portal
The following pages link to Clustering wireless ad hoc networks with weakly connected dominating set (Q883274):
Displaying 10 items.
- Constructing weakly connected dominating set for secure clustering in distributed sensor network (Q421263) (← links)
- Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks (Q663430) (← links)
- Clustering the wireless ad hoc networks: a distributed learning automata approach (Q666084) (← links)
- Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number (Q2231756) (← links)
- Self-stabilizing algorithm for two disjoint minimal dominating sets (Q2414045) (← links)
- LEARNING AUTOMATA-BASED ALGORITHMS FOR FINDING MINIMUM WEAKLY CONNECTED DOMINATING SET IN STOCHASTIC GRAPHS (Q3070074) (← links)
- (Q3175799) (← links)
- Algorithms – ESA 2004 (Q5464604) (← links)
- MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS (Q5696910) (← links)
- NP-completeness results for partitioning a graph into total dominating sets (Q5918107) (← links)
