55 citations · 277 across the 43 of their papers we have counts for
1 paper · 2 filters
Bernhard Bliem, Stefan Woltran
A set S of vertices of a graph is a defensive alliance if, for each element of S, the majority of its neighbors is in S. The problem of finding a defensive alliance of minimum size…