tl;dr: We provably improve GNN expressivity by enhancing message passing with substructure encodings. Our method allows incorporating domain specific prior knowledge and can be used as a drop-in ...

Abstract: Given a query graph, subgraph matching is the process of finding all the isomorphic graphs over a large data graph. Subgraph is one of the fundamental steps of many graph-based applications ...

A state of the art algorithm for the Graph Isomorphism problem, adjusted for Sub-Graph and Induced Sub-Graph Isomorphism and extended to directed and multigraph settings.

Abstract: The rise of graph analytic systems has created a need for ways to measure and compare the capabilities of these systems. Graph analytics present unique scalability difficulties. The machine ...