Recommendations
Cites work
Cited in
(19)- A compact mixed integer linear formulation for safe set problems
- Safe sets and in-dominating sets in digraphs
- Safe sets in graphs: graph classes and structural parameters
- Safe number and integrity of graphs
- Safe sets in graphs: graph classes and structural parameters
- On the connected safe number of some classes of graphs
- Stable structure on safe set problems in vertex-weighted graphs
- A new formulation for the safe set problem on graphs
- Extended MSO model checking via small vertex integrity
- A combinatorial branch and bound for the safe set problem
- Approximating connected safe sets in weighted trees
- The connected critical node problem
- An algorithmic framework for locally constrained homomorphisms
- Parameterized complexity of safe set
- On the weighted safe set problem on paths and cycles
- Constructive-destructive heuristics for the safe set problem
- Models and algorithms for the weighted safe set problem
- scientific article; zbMATH DE number 6986946 (Why is no real title available?)
- scientific article; zbMATH DE number 7746012 (Why is no real title available?)
This page was built for publication: Safe set problem on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323046)
