Graph NN that recognizes graph connectivity?
I am faced with a problem which posed the following question. Suppose a set of graphs, where each graph can be composed of, at least, two nodes, and at max, five nodes. Every node has a fixed size node feature, and connectivity can vary in any way in each of the graphs. Suppose that we … Read more