Efficient Pruned Top-K Subgraph Matching with Topology-Aware Bounds

Linglin Yang, Yuqi Zhou, Yue Pang, Lei Zou 0001. Efficient Pruned Top-K Subgraph Matching with Topology-Aware Bounds. In Edoardo Serra, Francesca Spezzano, editors, Proceedings of the 33rd ACM International Conference on Information and Knowledge Management, CIKM 2024, Boise, ID, USA, October 21-25, 2024. pages 2848-2857, ACM, 2024. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.