Pages that link to "Item:Q5131721"
From MaRDI portal
The following pages link to Computing Minimum <i>k</i>-Connected <i>m</i>-Fold Dominating Set in General Graphs (Q5131721):
Displaying 7 items.
- A greedy algorithm for the fault-tolerant outer-connected dominating set problem (Q2025101) (← links)
- Approximating \(k\)-connected \(m\)-dominating sets (Q2144267) (← links)
- A game theoretic approach for minimal connected dominating set (Q2193269) (← links)
- Optimal channel assignment with list-edge coloring (Q2424801) (← links)
- Construction of minimum edge-fault tolerant connected dominating set in a general graph (Q2698012) (← links)
- Constant Approximation for the Lifetime Scheduling Problem of <i>p</i>-Percent Coverage (Q5058008) (← links)
- Approximating k-Connected m-Dominating Sets (Q5874545) (← links)
