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, 4 , 0, 5 , 0, 6 , 0, 7 , 0, 8 , 0, 9 , 0, 11 , 0, 12 , 0, 14 , 0, 16 , 0, 19 , 0, 22 , 0, 23 , 0, 24 , 0, 26 , 0, 27 , 0…
The task
An undirected simple graph has 44 vertices labelled 0..43 and edge list [[0, 2], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 11], [0, 12], [0, 14], [0, 16], [0, 19], [0, 22], [0, 23], [0, 24], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [0, 35], [0, 36], [0, 37], [0, 38], [0, 39],…