Pages that link to "Item:Q2698012"
From MaRDI portal
The following pages link to Construction of minimum edge-fault tolerant connected dominating set in a general graph (Q2698012):
Displaying 4 items.
- A greedy algorithm for the fault-tolerant connected dominating set in a general graph (Q405692) (← links)
- A greedy algorithm for the fault-tolerant outer-connected dominating set problem (Q2025101) (← links)
- Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set (Q4989343) (← links)
- A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem (Q5963614) (← links)