construct/rlve maximum clique
construct/rlve maximum clique: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). An undirected simple graph has 44 vertices labelled 0..43 and edge list 0, 2 , 0, 3 , 0, 4 , 0, 6 , 0, 7 , 0, 13 , 0, 20 , 0, 22 , 0, 25 , 0, 31 , 0, 32 , 0, 33 , 0, 34 , 0, 36 , 0, 38 , 0, 39 , 0, 40 , 0…
The task
An undirected simple graph has 44 vertices labelled 0..43 and edge list [[0, 2], [0, 3], [0, 4], [0, 6], [0, 7], [0, 13], [0, 20], [0, 22], [0, 25], [0, 31], [0, 32], [0, 33], [0, 34], [0, 36], [0, 38], [0, 39], [0, 40], [0, 41], [0, 42], [0, 43], [1, 3], [1, 5], [1, 6], [1, 7], [1, 9], [1, 10], [1, 11], [1, 12], [1,…