{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:58:29Z","timestamp":1775638709227,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T00:00:00Z","timestamp":1704326400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,1,4]]},"DOI":"10.1145\/3632410.3632459","type":"proceedings-article","created":{"date-parts":[[2024,1,3]],"date-time":"2024-01-03T18:15:16Z","timestamp":1704305716000},"page":"18-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["VeNoM: Approximate Subgraph Matching with Enhanced Neighbourhood Structural Information"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-4405-4833","authenticated-orcid":false,"given":"Shubhangi","family":"Agarwal","sequence":"first","affiliation":[{"name":"Computer Science and Engineering, Indian Institute of Technology Kanpur, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8934-9166","authenticated-orcid":false,"given":"Sourav","family":"Dutta","sequence":"additional","affiliation":[{"name":"Huawei Research, Ireland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7331-0788","authenticated-orcid":false,"given":"Arnab","family":"Bhattacharya","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering, Indian Institute of Technology Kanpur, India"}]}],"member":"320","published-online":{"date-parts":[[2024,1,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Shubhangi Agarwal Sourav Dutta and Arnab Bhattacharya. 2021. VerSaChI: Finding Statistically Significant Subgraph Matches using Chebyshev\u2019s Inequality. In CIKM. ACM 2812\u20132816.","DOI":"10.1145\/3459637.3482217"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"F. Bi L. Chang X. Lin L. Qin and W. Zhang. 2016. Efficient Subgraph Matching by Postponing Cartesian Products. In SIGMOD. 1199\u20131214.","DOI":"10.1145\/2882903.2915236"},{"key":"e_1_3_2_1_4_1","volume-title":"On the variable ordering in Subgraph Isomorphism Algorithms","author":"Bonnici Vincenzo","year":"2016","unstructured":"Vincenzo Bonnici and Rosalba Giugno. 2016. On the variable ordering in Subgraph Isomorphism Algorithms. IEEE\/ACM transactions on computational biology and bioinformatics 14, 1 (2016), 193\u2013203."},{"key":"e_1_3_2_1_5_1","unstructured":"Chen Chen Xifeng Yan S\u00a0Yu Philip Jiawei Han Dong\u00a0Qing Zhang and Xiaohui Gu. 2007. Towards Graph Containment Search and Indexing. In PVLDB. 926\u2013937."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001418500209"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"James Cheng Yiping Ke Wilfred Ng and An Lu. 2007. FG-Index: Towards Verification-free Query Processing on Graph Databases. In SIGMOD. 857\u2013872.","DOI":"10.1145\/1247480.1247574"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"e_1_3_2_1_9_1","volume-title":"Carlo Sansone, and Mario Vento","author":"Cordella P","year":"2004","unstructured":"Luigi\u00a0P Cordella, Pasquale Foggia, Carlo Sansone, and Mario Vento. 2004. A (sub) graph isomorphism algorithm for matching large graphs. IEEE transactions on pattern analysis and machine intelligence 26, 10 (2004), 1367\u20131372."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Sourav Dutta Pratik Nayek and Arnab Bhattacharya. 2017. Neighbor-aware search for approximate labeled graph matching using the chi-square statistics. In WWW\u201917. 1281\u20131290.","DOI":"10.1145\/3038912.3052561"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319880"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465300"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920901"},{"key":"e_1_3_2_1_14_1","first-page":"824","article-title":"Answering Natural Language Questions by Subgraph Matching over Knowledge Graphs","volume":"30","author":"Hu Sen","year":"2018","unstructured":"Sen Hu, Lei Zou, Jeffrey\u00a0Xu Yu, Haixun Wang, and Dongyan Zhao. 2018. Answering Natural Language Questions by Subgraph Matching over Knowledge Graphs. IEEE TKDE 30, 5 (2018), 824\u2013837.","journal-title":"IEEE TKDE"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-010-0376-y"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824054"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535569.2448952"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.01.019"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535568.2448946"},{"key":"e_1_3_2_1_20_1","volume-title":"G-Finder: Approximate Attributed Subgraph Matching. In 2019 IEEE International Conference on Big Data (Big Data). IEEE, 513\u2013522","author":"Liu Lihui","year":"2019","unstructured":"Lihui Liu, Boxin Du, Hanghang Tong, 2019. G-Finder: Approximate Attributed Subgraph Matching. In 2019 IEEE International Conference on Big Data (Big Data). IEEE, 513\u2013522."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2875262"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1142\/S021972001000477X"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735493"},{"key":"e_1_3_2_1_24_1","volume-title":"Exact and Inexact Graph Matching: Methodology and Applications. Managing and Mining Graph Data","author":"Riesen Kaspar","year":"2010","unstructured":"Kaspar Riesen, Xiaoyi Jiang, and Horst Bunke. 2010. Exact and Inexact Graph Matching: Methodology and Applications. Managing and Mining Graph Data (2010), 217\u2013247."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0968-2"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"R.\u00a0A. Rossi and N.\u00a0K. Ahmed. 2015. The Network Data Repository with Interactive Graph Analytics and Visualization. In AAAI. 4292\u20134293.","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"e_1_3_2_1_27_1","first-page":"94","article-title":"Community Detection Based on Isomorphic Subgraph Analytics in Criminal Network","volume":"20","author":"Sangkaran Theyvaa","year":"2020","unstructured":"Theyvaa Sangkaran, Azween Abdullah, and NZ Jhanjhi. 2020. Community Detection Based on Isomorphic Subgraph Analytics in Criminal Network. IJCSNS 20, 5 (2020), 94.","journal-title":"IJCSNS"},{"key":"e_1_3_2_1_28_1","first-page":"85","article-title":"Survey on isomorphic graph algorithms for graph analytics","volume":"19","author":"Sangkaran Theyvaa","year":"2019","unstructured":"Theyvaa Sangkaran, Azween Abdullah, NZ JhanJhi, and Mahadevan Supramaniam. 2019. Survey on isomorphic graph algorithms for graph analytics. IJCSNS 19, 1 (2019), 85\u201392.","journal-title":"IJCSNS"},{"key":"e_1_3_2_1_29_1","volume-title":"Subgraph Isomorphism Algorithms for Matching Graphs: A Survey. IJETT 1, 1","author":"Somkunwar Ms\u00a0Rachna","year":"2017","unstructured":"Ms\u00a0Rachna Somkunwar and Vinod\u00a0Moreshwar Vaze. 2017. Subgraph Isomorphism Algorithms for Matching Graphs: A Survey. IJETT 1, 1 (2017)."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2021.03.134"},{"key":"e_1_3_2_1_31_1","unstructured":"Shixuan Sun and Qiong Luo. 2019. Scaling Up Subgraph Query Processing with Efficient Subgraph Matching. In ICDE. 220\u2013231."},{"key":"e_1_3_2_1_32_1","unstructured":"Shixuan Sun and Qiong Luo. 2020. In-Memory Subgraph Matching: An In-Depth Study. In ICMD (Portland OR USA) (SIGMOD). 16\u00a0pages."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-020-0360-y"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497505"},{"key":"e_1_3_2_1_35_1","volume-title":"ICMR (New York","author":"Yan Junchi","unstructured":"Junchi Yan, Xu-Cheng Yin, Weiyao Lin, Cheng Deng, Hongyuan Zha, and Xiaokang Yang. 2016. A Short Survey of Recent Advances in Graph Matching. In ICMR (New York, New York, USA). 167\u2013174."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1114244.1114248"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Xifeng Yan Philip\u00a0S. Yu and Jiawei Han. 2005. Substructure Similarity Search in Graph Databases. In SIGMOD. 766\u2013777.","DOI":"10.1145\/1066157.1066244"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516385"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920843"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920887"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353369"}],"event":{"name":"CODS-COMAD 2024: 7th Joint International Conference on Data Science & Management of Data (11th ACM IKDD CODS and 29th COMAD)","location":"Bangalore India","acronym":"CODS-COMAD 2024"},"container-title":["Proceedings of the 7th Joint International Conference on Data Science & Management of Data (11th ACM IKDD CODS and 29th COMAD)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3632410.3632459","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3632410.3632459","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T13:36:15Z","timestamp":1755869775000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3632410.3632459"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,4]]},"references-count":41,"alternative-id":["10.1145\/3632410.3632459","10.1145\/3632410"],"URL":"https:\/\/doi.org\/10.1145\/3632410.3632459","relation":{},"subject":[],"published":{"date-parts":[[2024,1,4]]},"assertion":[{"value":"2024-01-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}