Pages that link to "Item:Q5696910"
From MaRDI portal
The following pages link to MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS (Q5696910):
Displaying 19 items.
- Constructing weakly connected dominating set for secure clustering in distributed sensor network (Q421263) (← links)
- Distributed approximation of capacitated dominating sets (Q613113) (← 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)
- Finding minimum weight connected dominating set in stochastic graph based on learning automata (Q712488) (← links)
- Approximating minimum independent dominating sets in wireless networks (Q975555) (← links)
- A self-stabilizing algorithm for constructing weakly connected minimal dominating sets (Q989481) (← links)
- Construction of strongly connected dominating sets in asymmetric multihop wireless networks (Q1006037) (← links)
- A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks (Q1037372) (← links)
- The weakly connected independent set polytope in corona and join of graphs (Q1631656) (← links)
- The minimum weakly connected independent set problem: polyhedral results and branch-and-cut (Q1751176) (← links)
- The second largest number of maximal independent sets in connected graphs with at most one cycle (Q1928530) (← links)
- Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler (Q2379950) (← links)
- Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs (Q2446589) (← links)
- Local solutions for global problems in wireless networks (Q2466005) (← links)
- LEARNING AUTOMATA-BASED ALGORITHMS FOR FINDING MINIMUM WEAKLY CONNECTED DOMINATING SET IN STOCHASTIC GRAPHS (Q3070074) (← links)
- Efficient Self-Stabilizing Algorithm for Independent Strong Dominating Sets in Arbitrary Graphs (Q3455752) (← links)
- Algorithms for Steiner Connected Dominating Set Problem Based on Learning Automata Theory (Q3455753) (← links)
- On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm (Q5247696) (← links)
