Pages that link to "Item:Q828823"
From MaRDI portal
The following pages link to An improved binary programming formulation for the secure domination problem (Q828823):
Displaying 6 items.
- The secure domination number of Cartesian products of small graphs with paths and cycles (Q2065763) (← links)
- A compact mixed integer linear formulation for safe set problems (Q2228393) (← links)
- Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee (Q2234781) (← links)
- Binary programming formulations for the upper domination problem (Q6080758) (← links)
- Variants of the domination number for flower snarks (Q6597991) (← links)
- PTASs for secure dominating set in planar graphs and growth-bounded graphs (Q6611035) (← links)