Finding all isomorphism pairs in a graph data set. Running classification models. Given proper format of graphs, one can find all graph orbits in a data set efficiently (i.e. groups of graphs that are ...

This package implements python bindings for the ORbit Counting Algorithm. The original source code was modified to avoid memory leaks upon repeated function calls and allow for parallel orbit counting ...

Abstract: A graph structure is a powerful mathematical abstraction, which can not only represent information about individuals but also capture the interactions between individuals for reasoning.

Abstract: In several applications the information is naturally represented by graphs. Traditional approaches cope with graphical data structures using a preprocessing phase which transforms the graphs ...