Safe set problem on graphs
From MaRDI portal
Publication:323046
DOI10.1016/j.dam.2016.07.020zbMath1346.05141OpenAlexW2477185620MaRDI QIDQ323046
Gary MacGillivray, Shinya Fujita, 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
Related Items (16)
Safe sets in graphs: graph classes and structural parameters ⋮ Safe number and integrity of graphs ⋮ The connected critical node problem ⋮ Approximating connected safe sets in weighted trees ⋮ Constructive-destructive heuristics for the safe set problem ⋮ On the weighted safe set problem on paths and cycles ⋮ Safe Sets in Graphs: Graph Classes and Structural Parameters ⋮ Models and algorithms for the weighted safe set problem ⋮ 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 ⋮ Parameterized Complexity of Safe Set ⋮ 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 connected safe number of some classes of graphs
Cites Work
This page was built for publication: Safe set problem on graphs
