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 389 edges: 0, 1 , 0, 2 , 0, 7 , 0, 8 , 0, 10 , 0, 27 , 0, 28 , 0, 30 , 0, 31 , 0, 35 , 0, 43 , 0, 44 , 0, 48 , 1, 4 , 1, 10 , 1, 11 , 1, 17 , 1, 18 , 1…
The task
Undirected graph with 50 vertices labelled 0..49 and 389 edges: [[0, 1], [0, 2], [0, 7], [0, 8], [0, 10], [0, 27], [0, 28], [0, 30], [0, 31], [0, 35], [0, 43], [0, 44], [0, 48], [1, 4], [1, 10], [1, 11], [1, 17], [1, 18], [1, 21], [1, 29], [1, 32], [1, 35], [1, 37], [1, 41], [1, 42], [1, 43], [1, 44], [2, 3], [2, 5],…