construct/rlve graph isomorphism
construct/rlve graph isomorphism: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). Two undirected simple graphs G1 and G2 each have 18 vertices labelled 0..17 and 84 edges. G1 edges: 14, 17 , 12, 17 , 5, 8 , 1, 11 , 12, 13 , 10, 14 , 16, 17 , 3, 12 , 8, 16 , 15, 17 , 6, 13 , 3, 17 …
The task
Two undirected simple graphs G1 and G2 each have 18 vertices labelled 0..17 and 84 edges. G1 edges: [[14, 17], [12, 17], [5, 8], [1, 11], [12, 13], [10, 14], [16, 17], [3, 12], [8, 16], [15, 17], [6, 13], [3, 17], [9, 14], [3, 13], [9, 16], [7, 12], [9, 12], [4, 6], [5, 6], [3, 9], [1, 6], [8, 12], [7, 16], [0, 9],…