Pages that link to "Item:Q5696912"
From MaRDI portal
The following pages link to A SIMPLE HEURISTIC FOR MINIMUM CONNECTED DOMINATING SET IN GRAPHS (Q5696912):
Displaying 7 items.
- Experiments on data reduction for optimal domination in networks (Q863574) (← links)
- Computational study on planar dominating set problem (Q1040587) (← links)
- Analysis of a greedy heuristic for finding small dominating sets in graphs (Q1183397) (← links)
- Capacitated domination: problem complexity and approximation algorithms (Q2345937) (← links)
- (Q3703920) (← links)
- A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets (Q5085993) (← links)
- A hybrid population-based algorithm for solving the minimum dominating set problem (Q6617729) (← links)