Efficient Pruned Top-K Subgraph Matching with Topology-Aware Bounds.
Linglin Yang|Yuqi Zhou|Yue Pang|Lei Zou
| Anthology ID: | DBLP:conf/cikm/YangZP024 |
|---|---|
| Volume: | Proceedings of the 33rd ACM International Conference on Information and Knowledge Management, CIKM 2024, Boise, ID, USA, October 21-25, 2024 |
| Year: | 2024 |
| Venue: | International Conference on Information and Knowledge Management (CIKM) |
| Publisher: | ACM |
| Pages: | 2848-2857 |
| URL: | https://doi.org/10.1145/3627673.3679790 |
| DOI: | https://doi.org/10.1145/3627673.3679790 |
| DBLP: | conf/cikm/YangZP024 |
| BibTeX: |
@inproceedings{yang-2024-efficient,
author = {Linglin Yang and
Yuqi Zhou and
Yue Pang and
Lei Zou},
editor = {Edoardo Serra and
Francesca Spezzano},
title = {{Efficient Pruned Top-K Subgraph Matching with Topology-Aware Bounds}},
booktitle = {{Proceedings of the 33rd ACM International Conference on Information and Knowledge Management, CIKM 2024, Boise, ID, USA, October 21-25, 2024}},
pages = {2848--2857},
publisher = {ACM},
year = {2024},
url = {https://doi.org/10.1145/3627673.3679790},
doi = {https://doi.org/10.1145/3627673.3679790}
}