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