The following pages link to (Q5692521):
Displaying 24 items.
- New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
- The price of connectivity for dominating set: upper bounds and complexity (Q406321) (← links)
- A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs (Q418750) (← links)
- A note on connected dominating sets of distance-hereditary graphs (Q423975) (← links)
- Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem (Q437058) (← links)
- On positive influence dominating sets in social networks (Q621845) (← links)
- An exact algorithm for connected red-blue dominating set (Q635737) (← links)
- Tighter approximation bounds for minimum CDS in unit disk graphs (Q652528) (← links)
- On the parameterized complexity of reconfiguration of connected dominating sets (Q832526) (← links)
- An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs (Q906392) (← links)
- Solving connected dominating set faster than \(2^n\) (Q958203) (← links)
- On approximating (connected) 2-edge dominating set by a tree (Q1635808) (← links)
- Two algorithms for minimum 2-connected \(r\)-hop dominating set (Q1675775) (← links)
- The \(k\)-leaf spanning tree problem admits a klam value of 39 (Q1678098) (← links)
- The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
- A distributed approximation algorithm for the bottleneck connected dominating set problem (Q1926605) (← links)
- A cutting-plane algorithm for solving a weighted influence interdiction problem (Q2436687) (← links)
- On dominating sets whose induced subgraphs have a bounded diameter (Q2444556) (← links)
- 2-(edge-)connected edge domination number and matching number (Q2698534) (← links)
- Linear separation of connected dominating sets in graphs (Q5225055) (← links)
- A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph (Q5244687) (← links)
- On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm (Q5247696) (← links)
- On Approximating (Connected) 2-Edge Dominating Set by a Tree (Q5740184) (← links)
- Nordhaus-Gaddum-type results on the connected edge domination number (Q6202040) (← links)
