WL graph kernel for two lists of adjacency matrix #1
Description
Is there an implementation of WL graph kernel computation between two lists of adjacency matrices, apart from the pairwise on a single list one?
{{ message }}
Is there an implementation of WL graph kernel computation between two lists of adjacency matrices, apart from the pairwise on a single list one?