Explore projects

An implementation of the kdimensional WeisfeilerLehman method to test Group Isomorphism between 2 groups given by a list of generators. Starts up with by only implementing the 2dimensional WeisfeilerLehman method and then generalizes for any k.
Updated 
Using the framework of graph motif parameters, we obtain faster algorithms for counting subgraph copies of fixed graphs H in host graphs G.
Updated