Safe set problem on graphs
From MaRDI portal
Publication:323046
DOI10.1016/J.DAM.2016.07.020zbMATH Open1346.05141OpenAlexW2477185620MaRDI QIDQ323046FDOQ323046
Authors: Shinya Fujita, Gary MacGillivray, Tadashi Sakuma 
Publication date: 7 October 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.07.020
Recommendations
Cites Work
Cited In (19)
- Safe sets and in-dominating sets in digraphs
- A compact mixed integer linear formulation for safe set problems
- Safe sets in graphs: graph classes and structural parameters
- 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
- 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
- An algorithmic framework for locally constrained homomorphisms
- The connected critical node problem
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
