A combinatorial branch and bound for the safe set problem

DOI10.1002/net.22140zbMath1529.90085OpenAlexW4312205041MaRDI QIDQ6179692

Alberto Boggio Tomasaz, Roberto Cordone, Pierre Hosteins

Publication date: 18 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22140

zbMATH Keywords

branch-and-boundgraph partitioningsafe set

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Safe sets and in-dominating sets in digraphs

Cites Work

• Unnamed Item
• Safe set problem on graphs
• Network majority on tree topological network
• On the hardness of approximating minimum vertex cover
• Safe sets in graphs: graph classes and structural parameters
• Stable structure on safe set problems in vertex-weighted graphs. II: Recognition and complexity
• 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
• Parameterized Complexity of Safe Set
• Random Graphs

This page was built for publication: A combinatorial branch and bound for the safe set problem