Example:Majority Domination

• Instance: Graph G

• Problem: Select a subset S of the vertex set such that at least half of the vertices have a majority of their closed neighborhood in the subset.

Previous slide

Next slide

Back to first slide

View graphic version