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