Pages that link to "Item:Q2166772"
From MaRDI portal
The following pages link to A polynomial-time approximation to a minimum dominating set in a graph (Q2166772):
Displaying 8 items.
- Approximating the minimum independent dominating set in perturbed graphs (Q744108) (← links)
- A note on the complexity of minimum dominating set (Q2458924) (← links)
- Exponential time algorithms for the minimum dominating set problem on some graph classes (Q2930282) (← links)
- (Q3703920) (← links)
- A (2+ε)-Approximation Scheme for Minimum Domination on Circle Graphs (Q4538081) (← links)
- (Q4952684) (← links)
- A SIMPLE HEURISTIC FOR MINIMUM CONNECTED DOMINATING SET IN GRAPHS (Q5696912) (← links)
- Exact and heuristic algorithms for the domination problem (Q6555173) (← links)