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