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 133 edges: 0, 2 , 0, 4 , 0, 5 , 0, 6 , 0, 13 , 0, 17 , 0, 20 , 0, 22 , 0, 23 , 0, 24 , 0, 25 , 1, 4 , 1, 8 , 1, 10 , 1, 12 , 1, 13 , 1, 19 , 1, 23 , 1…
The task
Undirected graph with 30 vertices labelled 0..29 and 133 edges: [[0, 2], [0, 4], [0, 5], [0, 6], [0, 13], [0, 17], [0, 20], [0, 22], [0, 23], [0, 24], [0, 25], [1, 4], [1, 8], [1, 10], [1, 12], [1, 13], [1, 19], [1, 23], [1, 28], [1, 29], [2, 11], [2, 23], [2, 25], [2, 27], [2, 29], [3, 4], [3, 6], [3, 10], [3, 12],…