construct/rlve maximum clique
construct/rlve maximum clique: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). An undirected simple graph has 56 vertices labelled 0..55 and edge list 0, 1 , 0, 2 , 0, 4 , 0, 5 , 0, 6 , 0, 8 , 0, 9 , 0, 10 , 0, 11 , 0, 13 , 0, 14 , 0, 17 , 0, 21 , 0, 22 , 0, 24 , 0, 25 , 0, 26 , 0…
The task
An undirected simple graph has 56 vertices labelled 0..55 and edge list [[0, 1], [0, 2], [0, 4], [0, 5], [0, 6], [0, 8], [0, 9], [0, 10], [0, 11], [0, 13], [0, 14], [0, 17], [0, 21], [0, 22], [0, 24], [0, 25], [0, 26], [0, 27], [0, 30], [0, 32], [0, 36], [0, 38], [0, 39], [0, 41], [0, 42], [0, 45], [0, 46], [0, 48],…