Pages that link to "Item:Q2795935"
From MaRDI portal
The following pages link to On the Complexity Landscape of the Domination Chain (Q2795935):
Displaying 6 items.
- Parsimonious computational completeness (Q832917) (← links)
- Extension and its price for the connected vertex cover problem (Q2072064) (← links)
- Algorithmic aspects of upper paired-domination in graphs (Q2283034) (← links)
- Invited talks (Q2692717) (← links)
- Irredundance (Q3384112) (← links)
- Extension of some edge graph problems: standard, parameterized and approximation complexity (Q6048430) (← links)
