Pages that link to "Item:Q1702842"
From MaRDI portal
The following pages link to On computing a minimum secure dominating set in block graphs (Q1702842):
Displaying 13 items.
- An improved binary programming formulation for the secure domination problem (Q828823) (← links)
- The secure domination problem in cographs (Q1730021) (← links)
- Secure domination in rooted product graphs (Q2025078) (← links)
- The secure domination number of Cartesian products of small graphs with paths and cycles (Q2065763) (← links)
- Roman \(\{2\}\)-domination problem in graphs (Q2118251) (← links)
- A linear-time algorithm for weighted paired-domination on block graphs (Q2168726) (← links)
- A heuristic approximation algorithm of minimum dominating set based on rough set theory (Q2168768) (← links)
- Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee (Q2234781) (← links)
- Secure domination in cographs (Q2416434) (← 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)
- Algorithmic aspects of secure domination in unit disk graphs (Q6186318) (← links)
