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, 3 , 0, 4 , 0, 7 , 0, 10 , 0, 12 , 1, 4 , 1, 6 , 1, 7 , 2, 4 , 2, 5 , 2, 6 , 2, 12 , 2, 13 , 3, 8 , 3, 10 , 3, 11 , 3, 12 …
The task
An undirected simple graph has 14 vertices labelled 0..13 and edge list [[0, 1], [0, 3], [0, 4], [0, 7], [0, 10], [0, 12], [1, 4], [1, 6], [1, 7], [2, 4], [2, 5], [2, 6], [2, 12], [2, 13], [3, 8], [3, 10], [3, 11], [3, 12], [4, 5], [4, 7], [4, 9], [4, 12], [5, 6], [5, 8], [5, 10], [5, 13], [6, 9], [6, 11], [7, 11],…