Pages that link to "Item:Q2025101"
From MaRDI portal
The following pages link to A greedy algorithm for the fault-tolerant outer-connected dominating set problem (Q2025101):
Displaying 3 items.
- A greedy algorithm for the fault-tolerant connected dominating set in a general graph (Q405692) (← links)
- A note on `Algorithms for connected set cover problem and fault-tolerant connected set cover problem' (Q653341) (← links)
- Fault-tolerant total domination via submodular function approximation (Q6111966) (← links)