construct/rlve maximum clique
construct/rlve maximum clique: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). An undirected simple graph has 44 vertices labelled 0..43 and edge list 0, 3 , 0, 6 , 0, 8 , 0, 9 , 0, 10 , 0, 11 , 0, 12 , 0, 13 , 0, 14 , 0, 15 , 0, 19 , 0, 20 , 0, 21 , 0, 22 , 0, 23 , 0, 24 , 0, 25 …
The task
An undirected simple graph has 44 vertices labelled 0..43 and edge list [[0, 3], [0, 6], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 33], [0, 34], [0, 35], [0, 36], [0, 37], [0,…