Pages that link to "Item:Q2700783"
From MaRDI portal
The following pages link to Secure connected domination and secure total domination in unit disk graphs and rectangle graphs (Q2700783):
Displaying 6 items.
- Binary programming formulations for the upper domination problem (Q6080758) (← links)
- Algorithmic aspects of secure domination in unit disk graphs (Q6186318) (← links)
- A survey on variant domination problems in geometric intersection graphs (Q6536206) (← links)
- An algorithm for the secure total domination problem in proper interval graphs (Q6590080) (← links)
- PTASs for secure dominating set in planar graphs and growth-bounded graphs (Q6611035) (← links)
- The algorithm and complexity of co-secure domination in geometric intersection graphs (Q6653927) (← links)