Pages that link to "Item:Q2413340"
From MaRDI portal
The following pages link to Complexity issues of variants of secure domination in graphs (Q2413340):
Displaying 8 items.
- An improved binary programming formulation for the secure domination problem (Q828823) (← links)
- The complexity of secure domination problem in graphs (Q1708386) (← links)
- Algorithmic aspects of secure connected domination in graphs (Q2042631) (← links)
- Algorithmic aspects of 2-secure domination in graphs (Q2045038) (← links)
- Domination and its variants in split graphs \(-\text{P}\) versus NPC dichotomy (Q2692638) (← links)
- Eternal and Secure Domination in Graphs (Q3384616) (← links)
- Algorithmic Aspects of Some Variants of Domination in Graphs (Q5002958) (← links)
- Complexity issues of perfect secure domination in graphs (Q5037201) (← links)