construct/rlve maximum clique
construct/rlve maximum clique: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). An undirected simple graph has 32 vertices labelled 0..31 and edge list 0, 4 , 0, 5 , 0, 6 , 0, 8 , 0, 13 , 0, 14 , 0, 16 , 0, 18 , 0, 19 , 0, 20 , 0, 22 , 0, 23 , 0, 25 , 0, 26 , 0, 28 , 0, 29 , 0, 31 …
The task
An undirected simple graph has 32 vertices labelled 0..31 and edge list [[0, 4], [0, 5], [0, 6], [0, 8], [0, 13], [0, 14], [0, 16], [0, 18], [0, 19], [0, 20], [0, 22], [0, 23], [0, 25], [0, 26], [0, 28], [0, 29], [0, 31], [1, 2], [1, 3], [1, 6], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 19], [1, 23],…