Abstract: Subgraph matching (SM) is a fundamental problem in graph data analysis. Real-world patterns used in graph analysis are often symmetric and contain isomorphic substructures, but existing SM ...
Abstract: Subgraph matching is a core primitive in graph analytics, yet it remains difficult to scale due to its combinatorial complexity and highly irregular memory access patterns. Despite decades ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results