CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination

Linglin Yang, Xunbin Su, Lei Zou +2

Subgraph matching is a fundamental problem in graph analysis with a wide range of applications. However, due to its inherent NP-hardness, enumerating subgraph matches efficiently o…