CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination
Summary: CEMR: DFS-based subgraph matching with redundant-extension elimination. Uses black-white vertex encoding to merge common extensions plus reusable extension buffers and pruning, cutting duplicate work during enumeration and beating prior state of the art. (summarized by gpt-5.4-mini on May 27 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Linglin Yang (Peking University)
- 2. Xunbin Su (Peking University)
- 3. Lei Zou (Peking University)
- 4. Xiangyang Gou (University of New South Wales)
- 5. Yinnian Lin (Peking University)
BibTeX Citation
@article{yang_vldb26,
title = {{CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination}},
author = {Yang, Linglin and Su, Xunbin and Zou, Lei and Gou, Xiangyang and Lin, Yinnian},
journal = {PVLDB},
series = {{VLDB} '26},
volume = {19},
number = {7},
pages = {1572--1585},
doi = {10.14778/3801059.3801070},
url = {https://doi.org/10.14778/3801059.3801070},
year = {2026}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 30 of 30 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next