construct/nppc dominating set
construct/nppc dominating set: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). Undirected graph with 50 vertices labelled 0..49 and 384 edges: 0, 1 , 0, 6 , 0, 9 , 0, 13 , 0, 19 , 0, 20 , 0, 22 , 0, 26 , 0, 27 , 0, 34 , 0, 35 , 0, 37 , 0, 39 , 0, 42 , 1, 6 , 1, 11 , 1, 13 , 1, 15 …
The task
Undirected graph with 50 vertices labelled 0..49 and 384 edges: [[0, 1], [0, 6], [0, 9], [0, 13], [0, 19], [0, 20], [0, 22], [0, 26], [0, 27], [0, 34], [0, 35], [0, 37], [0, 39], [0, 42], [1, 6], [1, 11], [1, 13], [1, 15], [1, 19], [1, 22], [1, 24], [1, 26], [1, 28], [1, 34], [1, 36], [1, 38], [1, 40], [1, 48], [2,…