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