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, 3 , 0, 4 , 0, 5 , 0, 10 , 0, 11 , 0, 12 , 0, 13 , 0, 14 , 0, 15 , 0, 16 , 0, 17 , 0, 20 , 0, 22 , 0, 23 , 0, 24 , 0, 25 , 0, 27 …
The task
An undirected simple graph has 32 vertices labelled 0..31 and edge list [[0, 3], [0, 4], [0, 5], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 20], [0, 22], [0, 23], [0, 24], [0, 25], [0, 27], [0, 30], [0, 31], [1, 2], [1, 3], [1, 4], [1, 7], [1, 10], [1, 14], [1, 15], [1, 16], [1, 17],…