10 citations · 10 across the 2 of their papers we have counts for
1 paper · 1 filter
Bernhard Bliem, Stefan Woltran
A secure set S in a graph is defined as a set of vertices such that for any X⊆S the majority of vertices in the neighborhood of X belongs to S. It is known that de…