Pages that link to "Item:Q1708386"
From MaRDI portal
The following pages link to The complexity of secure domination problem in graphs (Q1708386):
Displaying 24 items.
- An improved binary programming formulation for the secure domination problem (Q828823) (← links)
- On the secure domination numbers of maximal outerplanar graphs (Q1693127) (← links)
- On computing a minimum secure dominating set in block graphs (Q1702842) (← links)
- The secure domination problem in cographs (Q1730021) (← links)
- A simple algorithm for secure domination in proper interval graphs (Q1741524) (← links)
- Secure total domination in graphs: bounds and complexity (Q1786876) (← links)
- Secure Italian domination in graphs (Q2025095) (← links)
- Algorithmic aspects of secure connected domination in graphs (Q2042631) (← links)
- Algorithmic aspects of 2-secure domination in graphs (Q2045038) (← 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)
- On secure domination in graphs (Q2348710) (← links)
- Complexity issues of variants of secure domination in graphs (Q2413340) (← links)
- Eternal and Secure Domination in Graphs (Q3384616) (← links)
- Secure total domination in chain graphs and cographs (Q4956172) (← links)
- Algorithmic Aspects of Some Variants of Domination in Graphs (Q5002958) (← links)
- On computing secure domination of trees (Q5025125) (← links)
- Complexity issues of perfect secure domination in graphs (Q5037201) (← links)
- Secure domination of some graph operators (Q6089327) (← links)
- Algorithmic aspects of secure domination in unit disk graphs (Q6186318) (← links)
- Some new algorithmic results on co-secure domination in graphs (Q6190005) (← links)
- On the complexity of co-secure dominating set problem (Q6195337) (← links)
- PTASs for secure dominating set in planar graphs and growth-bounded graphs (Q6611035) (← links)
