Pages that link to "Item:Q5025125"
From MaRDI portal
The following pages link to On computing secure domination of trees (Q5025125):
Displaying 8 items.
- An improved binary programming formulation for the secure domination problem (Q828823) (← links)
- On computing a minimum secure dominating set in block graphs (Q1702842) (← links)
- The secure domination problem in cographs (Q1730021) (← links)
- A linear algorithm for secure domination in trees (Q2449101) (← links)
- (Q3428660) (← links)
- On connected co-independent domination in the join, corona and lexicographic product of graphs (Q6132866) (← 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)