Pages that link to "Item:Q4956219"
From MaRDI portal
The following pages link to Algorithmic complexity of secure connected domination in graphs (Q4956219):
Displaying 8 items.
- A simple algorithm for secure domination in proper interval graphs (Q1741524) (← links)
- Algorithmic aspects of secure connected domination in graphs (Q2042631) (← links)
- Algorithmic aspects of 2-secure domination in graphs (Q2045038) (← links)
- Secure connected domination and secure total domination in unit disk graphs and rectangle graphs (Q2700783) (← links)
- On computing secure domination of trees (Q5025125) (← links)
- Complexity issues of perfect secure domination in graphs (Q5037201) (← links)
- Algorithmic aspects of certified domination in graphs (Q6101494) (← links)
- On the complexity of co-secure dominating set problem (Q6195337) (← links)