construct/rlve maximum clique
construct/rlve maximum clique: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). An undirected simple graph has 22 vertices labelled 0..21 and edge list 0, 1 , 0, 2 , 0, 5 , 0, 9 , 0, 11 , 0, 12 , 0, 13 , 0, 17 , 0, 18 , 0, 20 , 1, 5 , 1, 7 , 1, 9 , 1, 10 , 1, 15 , 1, 19 , 2, 3 , 2, 4…
The task
An undirected simple graph has 22 vertices labelled 0..21 and edge list [[0, 1], [0, 2], [0, 5], [0, 9], [0, 11], [0, 12], [0, 13], [0, 17], [0, 18], [0, 20], [1, 5], [1, 7], [1, 9], [1, 10], [1, 15], [1, 19], [2, 3], [2, 4], [2, 5], [2, 9], [2, 12], [2, 13], [2, 17], [2, 18], [3, 7], [3, 8], [3, 9], [3, 10], [3,…