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 138 edges: 0, 1 , 0, 5 , 0, 9 , 0, 12 , 0, 14 , 0, 16 , 0, 18 , 0, 20 , 1, 6 , 1, 9 , 1, 10 , 1, 14 , 1, 15 , 1, 17 , 1, 20 , 1, 25 , 1, 26 , 1, 28 , 1…
The task
Undirected graph with 30 vertices labelled 0..29 and 138 edges: [[0, 1], [0, 5], [0, 9], [0, 12], [0, 14], [0, 16], [0, 18], [0, 20], [1, 6], [1, 9], [1, 10], [1, 14], [1, 15], [1, 17], [1, 20], [1, 25], [1, 26], [1, 28], [1, 29], [2, 3], [2, 5], [2, 7], [2, 9], [2, 12], [2, 23], [2, 26], [2, 27], [3, 6], [3, 11],…