Hello.
I'd like to learn is it possible to classify graphs with edges connecting more than two nodes?
For example, if we have a classical graph, we use an adjacency matrix like (N, N) and edge features like (N, N, S).
But if we want to use connections of, say, three nodes, it will look like (N, N, N) and (N, N, N, S).
Is it feasible now?
Hello. I'd like to learn is it possible to classify graphs with edges connecting more than two nodes? For example, if we have a classical graph, we use an adjacency matrix like (N, N) and edge features like (N, N, S). But if we want to use connections of, say, three nodes, it will look like (N, N, N) and (N, N, N, S). Is it feasible now?