{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T06:13:40Z","timestamp":1766124820122,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","funder":[{"name":"National Key Research and Development Program of China","award":["2022YFB3305500"],"award-info":[{"award-number":["2022YFB3305500"]}]},{"name":"National Natural Science Foundation of China","award":["62002155"],"award-info":[{"award-number":["62002155"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1145\/3769534.3769546","type":"proceedings-article","created":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T06:05:38Z","timestamp":1766124338000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Dynamic Multi-hop Attention Integrated Graph Neural Network for Subgraph Matching"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-8799-610X","authenticated-orcid":false,"given":"Siting","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Computer and Artificial Intelligence, Nanjing University of Finance and Economics, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7763-5552","authenticated-orcid":false,"given":"Yufeng","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer and Artificial Intelligence, Nanjing University of Finance and Economics, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-6290-7179","authenticated-orcid":false,"given":"Yuefei","family":"Qu","sequence":"additional","affiliation":[{"name":"School of Computer and Artificial Intelligence, Nanjing University of Finance and Economics, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1765-4409","authenticated-orcid":false,"given":"Jun","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Computer and Artificial Intelligence, Nanjing University of Finance and Economics, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,12,18]]},"reference":[{"key":"e_1_3_3_1_2_2","doi-asserted-by":"crossref","unstructured":"Wang Yuxuan and Xia Ying and Yan Junchi and Yuan Ye and Shen Hong-Bin and Pan Xiaoyong. 2023. ZeroBind: a protein-specific zero-shot predictor with subgraph matching for drug-target interactions. Nature Communications 14(1): 7861.","DOI":"10.1038\/s41467-023-43597-1"},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"crossref","unstructured":"Nie Weizhi and Ding Hai and Liu Anan and Deng Zonghui and Su Yuting. 2020. Subgraph learning for graph matching. Pattern Recognition Letters 130: 362\u2013369.","DOI":"10.1016\/j.patrec.2018.07.005"},{"key":"e_1_3_3_1_4_2","unstructured":"Tu Thomas K. 2021. Subgraph matching on attributed multiplex networks with applications to knowledge graphs."},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"crossref","unstructured":"Cordella Luigi P and Foggia Pasquale and Sansone Carlo and Vento Mario. 2004. A (sub) graph isomorphism algorithm for matching large graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence 26(10): 1367\u20131372.","DOI":"10.1109\/TPAMI.2004.75"},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"crossref","unstructured":"Grohe Martin and Schweitzer Pascal. 2020. The graph isomorphism problem. Communications of the ACM 63(11) 128\u2013134.","DOI":"10.1145\/3372123"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"crossref","unstructured":"Lewis Harry R. Michael R. \u03a0 Garey and David S. Johnson. Computers and intractability. 1983. Computers and Intractability: A Guide to the Theory of NP-Completeness. The Journal of Symbolic Logic 48(2) 498\u2013500.","DOI":"10.2307\/2273574"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"crossref","unstructured":"Carletti Vincenzo and Foggia Pasquale and Saggese Alessia and Vento Mario. 2017. Introducing VF3: A new algorithm for subgraph isomorphism. In Graph-Based Representations in Pattern Recognition 11th IAPR-TC-15 Workshop (GbRPR 2017) 128\u2013139.","DOI":"10.1007\/978-3-319-58961-9_12"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"crossref","unstructured":"Han Wook-Shin and Lee Jinsoo and Lee Jeong-Hoon. 2013. TurboISO: Towards ultrafast and robust subgraph isomorphism search in large graph databases. In Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data 337\u2013348.","DOI":"10.1145\/2463676.2465300"},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"crossref","unstructured":"Bi Fei and Chang Lijun and Lin Xuemin and Qin Lu and Zhang Wenjie. 2016. Efficient subgraph matching by postponing cartesian products. In Proceedings of the 2016 International Conference on Management of Data 1199\u20131214.","DOI":"10.1145\/2882903.2915236"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"crossref","unstructured":"Tian Yuanyuan and Mceachin Richard C and Santos Carlos and States David J and Patel Jignesh M. 2007. SAGA: a subgraph matching tool for biological graphs. Bioinformatics 23(2):232\u2013239.","DOI":"10.1093\/bioinformatics\/btl571"},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"crossref","unstructured":"Tian Yuanyuan and Patel Jignesh M. 2008. Tale: A tool for approximate large graph matching. In 2008 IEEE 24th International Conference on Data Engineering (ICDE). IEEE 963\u2013972.","DOI":"10.1109\/ICDE.2008.4497505"},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"crossref","unstructured":"Tong Hanghang and Faloutsos Christos and Gallagher Brian and Eliassi-Rad Tina. 2007. Fast best-effort pattern matching in large attributed graphs. In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 737\u2013746.","DOI":"10.1145\/1281192.1281271"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"crossref","unstructured":"Liu Lihui and Du Boxin and Tong Hanghang and others. 2019. G-finder: Approximate attributed subgraph matching. In Proceedings of the 2019 IEEE International Conference on Big Data. IEEE 513\u2013522.","DOI":"10.1109\/BigData47090.2019.9006525"},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"crossref","unstructured":"Scarselli Franco and Gori Marco and Tsoi Ah Chung and Hagenbuchner Markus and Monfardini Gabriele. 2008. The graph neural network model. IEEE Transactions on Neural Networks. IEEE 20(1):61\u201380.","DOI":"10.1109\/TNN.2008.2005605"},{"key":"e_1_3_3_1_16_2","unstructured":"Kipf Thomas N and Welling Max. 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/1609.02907"},{"key":"e_1_3_3_1_17_2","unstructured":"Hamilton Will and Ying Zhitao and Leskovec Jure. 2017. Inductive representation learning on large graphs. Advances in Neural Information Processing Systems 30."},{"key":"e_1_3_3_1_18_2","unstructured":"Veli\u010dkovi\u0107 Petar and Cucurull Guillem and Casanova Arantxa and Romero Adriana and Lio Pietro and Bengio Yoshua. 2017. Graph attention networks. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/1710.10903"},{"key":"e_1_3_3_1_19_2","doi-asserted-by":"crossref","unstructured":"Bai Yunsheng and Ding Hao and Bian Song and Chen Ting and Sun Yizhou and Wang Wei. 2019. Simgnn: A neural network approach to fast graph similarity computation. In Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining 384\u2013392.","DOI":"10.1145\/3289600.3290967"},{"key":"e_1_3_3_1_20_2","doi-asserted-by":"crossref","unstructured":"Lan Zixun and Hong Binjie and Ma Ye and Ma Fei. 2024. More interpretable graph similarity computation via maximum common subgraph inference. IEEE Transactions on Knowledge and Data Engineering. IEEE.","DOI":"10.1109\/TKDE.2024.3387044"},{"key":"e_1_3_3_1_21_2","unstructured":"Lou Zhaoyu and You Jiaxuan and Wen Chengtao and Canedo Arquimedes and Leskovec Jure and others. 2020. Neural subgraph matching. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2007.03092"},{"key":"e_1_3_3_1_22_2","doi-asserted-by":"crossref","unstructured":"Ye Yutong and Lian Xiang and Chen Mingsong. 2024. Efficient exact subgraph matching via GNN-based path dominance embedding. Proceedings of the VLDB Endowment 17(7):1628\u20131641.","DOI":"10.14778\/3654621.3654630"},{"key":"e_1_3_3_1_23_2","doi-asserted-by":"crossref","unstructured":"Xu Jian and Wickramarathne Thanuka L and Chawla Nitesh V. 2016. Representing higher-order dependencies in networks. Science Advances 2(5):e1600028.","DOI":"10.1126\/sciadv.1600028"},{"key":"e_1_3_3_1_24_2","unstructured":"Brody Shaked and Alon Uri and Yahav Eran. 2021. How attentive are graph attention networks? arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2105.14491."},{"key":"e_1_3_3_1_25_2","doi-asserted-by":"crossref","unstructured":"Nguyen Thanh Toan and Nguyen Quang Duc and Ren Zhao and Jo Jun and Nguyen Quoc Viet Hung and Nguyen Thanh Tam. 2023. 10X Faster Subgraph Matching: Dual Matching Networks with Interleaved Diffusion Attention. In Proceedings of the 2023 International Joint Conference on Neural Networks (IJCNN). IEEE 1\u20139.","DOI":"10.1109\/IJCNN54540.2023.10191159"},{"key":"e_1_3_3_1_26_2","doi-asserted-by":"crossref","unstructured":"Lan Zixun and Ma Ye and Yu Limin and Yuan Linglong and Ma Fei. 2023. AEDNet: Adaptive edge-deleting network for subgraph matching. Pattern Recognition 133:109033.","DOI":"10.1016\/j.patcog.2022.109033"},{"key":"e_1_3_3_1_27_2","doi-asserted-by":"crossref","unstructured":"Bhattarai Bibek and Liu Hang and Huang H Howie. 2019. CECI: Compact embedding cluster index for scalable subgraph matching. In Proceedings of the 2019 International Conference on Management of Data 1447\u20131462.","DOI":"10.1145\/3299869.3300086"},{"key":"e_1_3_3_1_28_2","doi-asserted-by":"crossref","unstructured":"Shang Haichuan and Zhang Ying and Lin Xuemin and Yu Jeffrey Xu. 2008. Taming verification hardness: An efficient algorithm for testing subgraph isomorphism. Proceedings of the VLDB Endowment 1(1):364\u2013375.","DOI":"10.14778\/1453856.1453899"},{"key":"e_1_3_3_1_29_2","doi-asserted-by":"crossref","unstructured":"Han Myoungji and Kim Hyunjoon and Gu Geonmo and Park Kunsoo and Han Wook-Shin. 2019. Efficient subgraph matching: Harmonizing dynamic programming adaptive matching order and failing set together. In Proceedings of the 2019 International Conference on Management of Data 1429\u20131446.","DOI":"10.1145\/3299869.3319880"},{"key":"e_1_3_3_1_30_2","doi-asserted-by":"crossref","unstructured":"He Huahai and Singh Ambuj K. 2008. Graphs-at-a-time: Query language and access methods for graph databases. In Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data 405\u2013418.","DOI":"10.1145\/1376616.1376660"},{"key":"e_1_3_3_1_31_2","doi-asserted-by":"crossref","unstructured":"Wang Zhenghong and Wang Yi and Jia Furong and Zhang Fan and Klimenko Nikita and Wang Leye and He Zhengbing and Huang Zhou and Liu Yu. 2024. Spatiotemporal fusion transformer for large-scale traffic forecasting. Information Fusion 107:102293.","DOI":"10.1016\/j.inffus.2024.102293"},{"key":"e_1_3_3_1_32_2","doi-asserted-by":"crossref","unstructured":"Nguyen Duc Q and Nguyen Thanh Toan and Jo Jun and Poux Florent and Anirban Shikha and Quan Tho T. 2024. Explainable neural subgraph matching with learnable multi-hop attention. IEEE Access.","DOI":"10.1109\/ACCESS.2024.3458050"}],"event":{"name":"VINCI 2025: Proceedings of the 18th International Symposium on Visual Information Communication and Interaction","location":"Linz Austria","acronym":"VINCI 2025"},"container-title":["Proceedings of the 18th International Symposium on Visual Information Communication and Interaction"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3769534.3769546","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T06:09:26Z","timestamp":1766124566000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3769534.3769546"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":31,"alternative-id":["10.1145\/3769534.3769546","10.1145\/3769534"],"URL":"https:\/\/doi.org\/10.1145\/3769534.3769546","relation":{},"subject":[],"published":{"date-parts":[[2025,12]]},"assertion":[{"value":"2025-12-18","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}