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, 6 , 0, 8 , 0, 9 , 0, 11 , 0, 12 , 0, 14 , 0, 15 , 0, 16 , 0, 20 , 0, 22 , 0, 23 , 0, 24 , 0, 26 , 0, 27 , 0…
The task
An undirected simple graph has 32 vertices labelled 0..31 and edge list [[0, 1], [0, 2], [0, 3], [0, 6], [0, 8], [0, 9], [0, 11], [0, 12], [0, 14], [0, 15], [0, 16], [0, 20], [0, 22], [0, 23], [0, 24], [0, 26], [0, 27], [0, 29], [0, 31], [1, 2], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 15], [1, 18], [1,…