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, 4 , 0, 6 , 0, 8 , 0, 10 , 0, 14 , 0, 18 , 0, 20 , 0, 21 , 0, 22 , 0, 25 , 0, 26 , 0, 27 , 0, 28 , 0, 32 , 0, 33 , 0, 34 , 0, 36 …
The task
An undirected simple graph has 56 vertices labelled 0..55 and edge list [[0, 4], [0, 6], [0, 8], [0, 10], [0, 14], [0, 18], [0, 20], [0, 21], [0, 22], [0, 25], [0, 26], [0, 27], [0, 28], [0, 32], [0, 33], [0, 34], [0, 36], [0, 39], [0, 40], [0, 42], [0, 43], [0, 44], [0, 45], [0, 46], [0, 47], [0, 48], [0, 50], [0,…