Pages that link to "Item:Q405692"
From MaRDI portal
The following pages link to A greedy algorithm for the fault-tolerant connected dominating set in a general graph (Q405692):
Displaying 14 items.
- OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks (Q281809) (← links)
- Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs (Q331973) (← links)
- A note on `Algorithms for connected set cover problem and fault-tolerant connected set cover problem' (Q653341) (← links)
- Various bounds for liar's domination number (Q726641) (← links)
- On approximating (connected) 2-edge dominating set by a tree (Q1635808) (← 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)
- Construction of minimum edge-fault tolerant connected dominating set in a general graph (Q2698012) (← links)
- False alarms in fault-tolerant dominating sets in graphs (Q4908866) (← 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)
- On Approximating (Connected) 2-Edge Dominating Set by a Tree (Q5740184) (← links)
- A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem (Q5963614) (← links)
- Fault-tolerant total domination via submodular function approximation (Q6111966) (← links)
