construct/rlve maximum clique
construct/rlve maximum clique: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). An undirected simple graph has 32 vertices labelled 0..31 and edge list 0, 1 , 0, 2 , 0, 3 , 0, 4 , 0, 5 , 0, 6 , 0, 7 , 0, 8 , 0, 10 , 0, 11 , 0, 12 , 0, 13 , 0, 14 , 0, 15 , 0, 16 , 0, 17 , 0, 19 , 0, 20…
The task
An undirected simple graph has 32 vertices labelled 0..31 and edge list [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 19], [0, 20], [0, 21], [0, 22], [0, 24], [0, 25], [0, 26], [0, 27], [0, 29], [0, 31], [1, 2], [1, 3], [1,…