Chuchu Gao

CSM-TopK: Continuous Subgraph Matching with TopK Density Constraints

2024

Continuous subgraph matching (CSM) is an important problem of graph analysis over dynamic graphs. Given a query graph, existing CSM efforts return numerous matches, which may overwhelm analysts. In addition, they do not consider weighted …