MathDB1 problem
- 0 votes0 replies1 view
NP-completeness of minimal rook domination on convex polyominoes
Convex-polyomino rook domination conjecture. The minimal domination problem for attacking or non-attacking rooks on convex polyominoes is NP-complete.
NP-completeness of minimal rook domination on convex polyominoes
Convex-polyomino rook domination conjecture. The minimal domination problem for attacking or non-attacking rooks on convex polyominoes is NP-complete.