Work

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

Year: 2024

Type: conference-paper

Source: ACM International Conference on Information and Knowledge Management (CIKM)

DOI: 10.1145/3627673.3679790

Authors: Linglin Yang, Yuqi Zhou, Yue Pang, Lei Zou

Institution: Peking University

Language: English

Topic: Graph Theory and Algorithms

Subfield: Computer Vision and Pattern Recognition

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W4403582539

FWCI: 0.631

Cites: 26

Cited by: 3

Related to: 10