{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:55:24Z","timestamp":1773482124286,"version":"3.50.1"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/tkde.2022.3153523","type":"journal-article","created":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T15:36:44Z","timestamp":1645630604000},"page":"1-1","source":"Crossref","is-referenced-by-count":9,"title":["Accelerating Graph Similarity Search via Efficient GED Computation"],"prefix":"10.1109","author":[{"given":"Lijun","family":"Chang","sequence":"first","affiliation":[]},{"given":"Xing","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Kai","family":"Yao","sequence":"additional","affiliation":[]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00074"},{"key":"ref2","article-title":"Efficient graph edit distance computation and verification via anchor-aware lower bound estimation","author":"Chang","year":"2017","journal-title":"CoRR"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498246"},{"key":"ref4","first-page":"229","article-title":"Inves: Incremental partitioning-based verification for graph similarity search","volume-title":"Proc. 22nd Int. Conf. Extending Database Technol.","author":"Kim"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.129"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.28"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0306-1"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0487-0"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2349924"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687631"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2006.04.012"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.56"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/28.20.4021"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IEMBS.2005.1615679"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1983.6313167"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38221-5_15"},{"key":"ref17","first-page":"21","article-title":"Speeding up graph edit distance computation with a bipartite heuristic","volume-title":"Proc. 5th Int. Workshop Mining Learn. Graphs","author":"Riesen"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.5220\/0005209202710278"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-58961-9_19"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380120103"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/AICCSA.2007.370907"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1002\/spe.588"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00286-3"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/45.6.631"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3290967"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5720"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00520"},{"key":"ref28","volume-title":"Introduction to Algorithms","author":"Cormen","year":"2001"},{"key":"ref29","article-title":"The dynamic hungarian algorithm for the assignment problem with changing costs","volume-title":"Tech. Rep. CMU-RI-TR-07\u201327","author":"Korsah","year":"2007"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/4358933\/09720081.pdf?arnumber=9720081","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T18:50:57Z","timestamp":1705517457000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9720081\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/tkde.2022.3153523","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}