Pages that link to "Item:Q5963614"
From MaRDI portal
The following pages link to A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem (Q5963614):
Displaying 16 items.
- A greedy algorithm for the fault-tolerant connected dominating set in a general graph (Q405692) (← links)
- On the construction of \(k\)-connected \(m\)-dominating sets in wireless networks (Q434202) (← links)
- Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem (Q437058) (← links)
- Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem (Q995580) (← 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)
- Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems (Q1799605) (← links)
- A greedy algorithm for the fault-tolerant outer-connected dominating set problem (Q2025101) (← links)
- Further results on the total monochromatic connectivity of graphs (Q2168754) (← links)
- Optimal channel assignment with list-edge coloring (Q2424801) (← links)
- On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs (Q2456357) (← links)
- Construction of minimum edge-fault tolerant connected dominating set in a general graph (Q2698012) (← 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)
- TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET (Q5189988) (← links)
- A novel local search approach with connected dominating degree-based incremental neighborhood evaluation for the minimum 2-connected dominating set problem (Q6645156) (← links)
