Weighted Safe Set Problem

Models and Algorithms for the Weighted Safe Set Problem

  • Enrico Malaguti
  • Vagner Pedrotti
    • Categories Branch and Cut Algorithms, Graphs and Matroids Tags , , ,

    Given a connected graph G = (V, E), a Safe Set S is a subset of the vertex set V such that the cardinality of each connected component in the subgraph induced by V \ S does not exceed the cardinality of any neighbor connected component in the subgraph induced by S. When the vertices … Read more