construct/nppc dominating set
construct/nppc dominating set: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). Undirected graph with 30 vertices labelled 0..29 and 142 edges: 0, 4 , 0, 11 , 0, 16 , 0, 20 , 0, 28 , 1, 2 , 1, 3 , 1, 8 , 1, 9 , 1, 10 , 1, 16 , 1, 21 , 1, 22 , 2, 7 , 2, 12 , 2, 15 , 2, 27 , 3, 4 , 3, 6…
The task
Undirected graph with 30 vertices labelled 0..29 and 142 edges: [[0, 4], [0, 11], [0, 16], [0, 20], [0, 28], [1, 2], [1, 3], [1, 8], [1, 9], [1, 10], [1, 16], [1, 21], [1, 22], [2, 7], [2, 12], [2, 15], [2, 27], [3, 4], [3, 6], [3, 10], [3, 15], [3, 17], [3, 19], [3, 22], [4, 6], [4, 10], [4, 19], [4, 20], [4, 23],…