{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:59Z","timestamp":1750220399746,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,26]],"date-time":"2021-11-26T00:00:00Z","timestamp":1637884800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"the Natural Science Foundation of China","award":["61873337,61572421"],"award-info":[{"award-number":["61873337,61572421"]}]},{"name":"the Shanghai Natural Science Foundation","award":["20ZR1402700"],"award-info":[{"award-number":["20ZR1402700"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,26]]},"DOI":"10.1145\/3503047.3503062","type":"proceedings-article","created":{"date-parts":[[2022,1,19]],"date-time":"2022-01-19T23:32:54Z","timestamp":1642635174000},"page":"1-7","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Research on the Optimal Methods for Graph Edit Distance"],"prefix":"10.1145","author":[{"given":"Xuan","family":"Wang","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Donghua University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziyang","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Information Management, Shanghai Lixin University of Accounting and Finance, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziyang","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Donghua University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,1,19]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings of the ACM conference on Hypertext, 11: 201-211","author":"Bernd A","year":"1992","unstructured":"Bernd A , Michel S. 1992 . Gram: a graph data model and query languages . Proceedings of the ACM conference on Hypertext, 11: 201-211 . DOI:https:\/\/doi.org\/10.1145\/168466.168527 10.1145\/168466.168527 Bernd A, Michel S. 1992. Gram: a graph data model and query languages. Proceedings of the ACM conference on Hypertext, 11: 201-211. DOI:https:\/\/doi.org\/10.1145\/168466.168527"},{"issue":"2","key":"e_1_3_2_1_2_1","article-title":"A survey on graph database management techniques for huge unstructured data","volume":"8","author":"Patil N","year":"2018","unstructured":"Patil N , Kiran P , Kiran N , 2018 . A survey on graph database management techniques for huge unstructured data . J Elect Computer Engin , 8 ( 2 ): 1140 DOI: https:\/\/doi.org\/10.11591\/ijece.v8i2.pp1140-1149 10.11591\/ijece.v8i2.pp1140-1149 Patil N, Kiran P, Kiran N, 2018. A survey on graph database management techniques for huge unstructured data. J Elect Computer Engin, 8(2): 1140 DOI: https:\/\/doi.org\/10.11591\/ijece.v8i2.pp1140-1149","journal-title":"J Elect Computer Engin"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2015.2401833"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMI.2012.2230186"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1021\/ci7001878"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2018.05.002"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2019.10.028"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(01)00017-4"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213896"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498246"},{"key":"e_1_3_2_1_11_1","volume-title":"Fast Computation of Graph Edit Distance. arXiv preprint arXiv:170910305","author":"Chen X","year":"2017","unstructured":"Chen X , Huo H , Huan J , 2017. Fast Computation of Graph Edit Distance. arXiv preprint arXiv:170910305 , 2017 . Chen X, Huo H, Huan J, 2017. Fast Computation of Graph Edit Distance. arXiv preprint arXiv:170910305, 2017."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2772243"},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the 2017 IEEE 33rd ICDE, May 19-22","author":"Blumenthal D B","year":"2017","unstructured":"Blumenthal D B , Gamper J. 2017 . Correcting and speeding-up bounds for nonuniform graph edit distance . Proceedings of the 2017 IEEE 33rd ICDE, May 19-22 , San Diego, USA. 131-134. DOI:https:\/\/doi.org\/10.1109\/ICDE. 2017.57 10.1109\/ICDE.2017.57 Blumenthal D B, Gamper J. 2017. Correcting and speeding-up bounds for nonuniform graph edit distance. Proceedings of the 2017 IEEE 33rd ICDE, May 19-22, San Diego, USA. 131-134. DOI:https:\/\/doi.org\/10.1109\/ICDE.2017.57"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2017.07.029"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38221-5_15"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732232.2732236"},{"key":"e_1_3_2_1_17_1","unstructured":"Chang L Feng X Lin X 2017. Efficient graph edit distance computation and verification via anchor-aware lower bound estimation. arXiv preprint arXiv:170906810 Chang L Feng X Lin X 2017. Efficient graph edit distance computation and verification via anchor-aware lower bound estimation. arXiv preprint arXiv:170906810"},{"key":"e_1_3_2_1_18_1","volume-title":"Proceedings of MLG 2007","author":"Riesen K","year":"2007","unstructured":"Riesen K , Fankhauser S , Bunke H. 2007 . Speeding up graph edit distance computation with a Bipartite heuristic . Proceedings of MLG 2007 , August 1-2, Firence, Italy. DOI:https:\/\/doi.org\/10.1007\/978-3-642- 20844-7_11 10.1007\/978-3-642-20844-7_11 Riesen K, Fankhauser S, Bunke H. 2007. Speeding up graph edit distance computation with a Bipartite heuristic. Proceedings of MLG 2007, August 1-2, Firence, Italy. DOI:https:\/\/doi.org\/10.1007\/978-3-642-20844-7_11"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0306-1"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699878"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2349924"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Kuhn H W. 1955. The Hungarian method for the assignment problem. Naval research logistics quarterly 2(1\u20102): 83-97.  Kuhn H W. 1955. The Hungarian method for the assignment problem. Naval research logistics quarterly 2(1\u20102): 83-97.","DOI":"10.1002\/nav.3800020109"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.129"}],"event":{"name":"AISS 2021: 2021 3rd International Conference on Advanced Information Science and System","acronym":"AISS 2021","location":"Sanya China"},"container-title":["Proceedings of the 3rd International Conference on Advanced Information Science and System"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3503047.3503062","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3503047.3503062","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:49Z","timestamp":1750191529000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3503047.3503062"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,26]]},"references-count":23,"alternative-id":["10.1145\/3503047.3503062","10.1145\/3503047"],"URL":"https:\/\/doi.org\/10.1145\/3503047.3503062","relation":{},"subject":[],"published":{"date-parts":[[2021,11,26]]},"assertion":[{"value":"2022-01-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}