Safe set problem on graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(22)- Safe sets in graphs: graph classes and structural parameters
- Safe number and integrity of graphs
- On the connected safe number of some classes of graphs
- Approximating connected safe sets in weighted trees
- Stable structure on safe set problems in vertex-weighted graphs
- A compact mixed integer linear formulation for safe set problems
- A new formulation for the safe set problem on graphs
- On the weighted safe set problem on paths and cycles
- The connected critical node problem
- Models and algorithms for the weighted safe set problem
- Safe sets in graphs: graph classes and structural parameters
- scientific article; zbMATH DE number 6986946 (Why is no real title available?)
- Parameterized complexity of safe set
- Constructive-destructive heuristics for the safe set problem
- scientific article; zbMATH DE number 7746012 (Why is no real title available?)
- Safe sets and in-dominating sets in digraphs
- A combinatorial branch and bound for the safe set problem
- Extended MSO model checking via small vertex integrity
- An algorithmic framework for locally constrained homomorphisms
- Estimation of domination number of graphs via safe number
- Complexity framework for forbidden subgraphs. IV: The Steiner forest problem
- Complexity framework for forbidden subgraphs. IV: The Steiner forest problem
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)
