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