Pages that link to "Item:Q1708386"
From MaRDI portal
The following pages link to The complexity of secure domination problem in graphs (Q1708386):
Displayed 11 items.
- An improved binary programming formulation for the secure domination problem (Q828823) (← links)
- The secure domination problem in cographs (Q1730021) (← links)
- Algorithmic aspects of secure connected domination in graphs (Q2042631) (← links)
- The secure domination number of Cartesian products of small graphs with paths and cycles (Q2065763) (← links)
- Algorithmic results in secure total dominating sets on graphs (Q2136269) (← links)
- Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee (Q2234781) (← links)
- Eternal and Secure Domination in Graphs (Q3384616) (← links)
- Secure total domination in chain graphs and cographs (Q4956172) (← links)
- Secure domination of some graph operators (Q6089327) (← links)
- Complexity results on cosecure domination in graphs (Q6132550) (← links)
- Cosecure domination: hardness results and algorithms (Q6182909) (← links)