{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:52:34Z","timestamp":1773481954018,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,2,2]],"date-time":"2021-02-02T00:00:00Z","timestamp":1612224000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"The Guangdong Pearl River Plan","award":["2019QN01X890"],"award-info":[{"award-number":["2019QN01X890"]}]},{"name":"the Hylink Digital Solutions Co., Ltd.","award":["120500002"],"award-info":[{"award-number":["120500002"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["Grant No. 71971127"],"award-info":[{"award-number":["Grant No. 71971127"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,2,2]]},"DOI":"10.1145\/3456529.3456548","type":"proceedings-article","created":{"date-parts":[[2021,7,13]],"date-time":"2021-07-13T22:35:45Z","timestamp":1626215745000},"page":"107-111","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Subgraph Isomorphism Building on A Hierarchical Query Graph"],"prefix":"10.1145","author":[{"given":"Wenjie","family":"Zhang","sequence":"first","affiliation":[{"name":"Tsinghua University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wai Kin","family":"(Victor) Chan","sequence":"additional","affiliation":[{"name":"Tsinghua University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319880"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.02.018"},{"key":"e_1_3_2_1_3_1","volume-title":"International Conference on Vision Interface.","author":"Bunke H."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"e_1_3_2_1_5_1","volume-title":"Efficient Searching of Subhypergraph Isomorphism in Hypergraph Databases. IEEE International Conference on Big Data & Smart Computing. IEEE.","author":"T. W.","year":"2018"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Liu X. Pan H. He M. Song Y. Jiang X. & Shang L. . 2019. Neural subgraph isomorphism counting.  Liu X. Pan H. He M. Song Y. Jiang X. & Shang L. . 2019. Neural subgraph isomorphism counting.","DOI":"10.1145\/3394486.3403247"},{"key":"e_1_3_2_1_7_1","volume-title":"International Workshop on Graph-Based Representations in Pattern Recognition. Springer, Cham.","author":"V.","year":"2017"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915236"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465300"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/2809974.2809985"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2012.90"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2016.2515595"},{"key":"e_1_3_2_1_14_1","first-page":"346","volume-title":"Proceedings of SIGMOD","author":"Yu P. S.","year":"2004"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492517.2492586"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2015.7363820"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/SIU.2019.8806332"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301427"},{"key":"e_1_3_2_1_19_1","volume-title":"Answering Natural Language Questions by Subgraph Matching over Knowledge Graphs,\" in IEEE Transactions on Knowledge and Data Engineering","author":"Hu S."},{"key":"e_1_3_2_1_20_1","unstructured":"Garey M Johnson D \" Computers and Intractability: A Guide to the Theory of NP-Completeness.\" Freeman and Company 1979  Garey M Johnson D \" Computers and Intractability: A Guide to the Theory of NP-Completeness.\" Freeman and Company 1979"}],"event":{"name":"ICCDA 2021: 2021 The 5th International Conference on Compute and Data Analysis","location":"Sanya China","acronym":"ICCDA 2021"},"container-title":["2021 The 5th International Conference on Compute and Data Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3456529.3456548","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3456529.3456548","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:30Z","timestamp":1750193250000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3456529.3456548"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,2]]},"references-count":20,"alternative-id":["10.1145\/3456529.3456548","10.1145\/3456529"],"URL":"https:\/\/doi.org\/10.1145\/3456529.3456548","relation":{},"subject":[],"published":{"date-parts":[[2021,2,2]]},"assertion":[{"value":"2021-07-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}