Pages that link to "Item:Q2042631"
From MaRDI portal
The following pages link to Algorithmic aspects of secure connected domination in graphs (Q2042631):
Displaying 11 items.
- The complexity of secure domination problem in graphs (Q1708386) (← links)
- A simple algorithm for secure domination in proper interval graphs (Q1741524) (← links)
- A Gröbner-Shirshov algorithm for applications in internet security (Q1931113) (← links)
- Algorithmic aspects of 2-secure domination in graphs (Q2045038) (← links)
- Complexity issues of variants of secure domination in graphs (Q2413340) (← links)
- Secure connected domination and secure total domination in unit disk graphs and rectangle graphs (Q2700783) (← links)
- (Q4550483) (← links)
- On computing secure domination of trees (Q5025125) (← links)
- Complexity issues of perfect secure domination in graphs (Q5037201) (← links)
- Algorithmic aspects of outer independent Roman domination in graphs (Q5101892) (← links)
- PTASs for secure dominating set in planar graphs and growth-bounded graphs (Q6611035) (← links)