External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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]

Authors

Linglin Yang

This author has not been identified. Look up 'Linglin Yang' in Google

Yuqi Zhou

This author has not been identified. Look up 'Yuqi Zhou' in Google

Yue Pang

This author has not been identified. Look up 'Yue Pang' in Google

Lei Zou 0001

This author has not been identified. Look up 'Lei Zou 0001' in Google
runs on