{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,24]],"date-time":"2026-09-24T04:57:59Z","timestamp":1790225879322,"version":"4.1.0"},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1109\/icdew.2019.000-7","type":"proceedings-article","created":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T23:27:03Z","timestamp":1562023623000},"page":"233-240","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Parallel Computing of Graph Edit Distance"],"prefix":"10.1109","author":[{"given":"Ran","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yixiang","family":"Fang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xing","family":"Feng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","first-page":"265","article-title":"Csi ged: an efficient approach for graph edit similarity computation","author":"gouda","year":"2016","journal-title":"International Conference on Data Engineering (ICDE)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.154"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2492561"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850472"},{"key":"ref14","first-page":"583","article-title":"Scaling distributed machine learning with the parameter server","volume":"14","author":"li","year":"2014","journal-title":"OSDI"},{"key":"ref15","article-title":"Efficient graph edit distance computation and verification via anchor-aware lower bound estimation","author":"chang","year":"2017"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1983.6313167"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(97)00179-7"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl571"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213896"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.129"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2006.12.009"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687631"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/28.20.4021"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0306-1"},{"key":"ref7","first-page":"21","article-title":"Speeding up graph edit distance computation with a bipartite heuristic","author":"riesen","year":"2007","journal-title":"MLG"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.56"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.5220\/0005209202710278"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2006.04.012"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2008.04.004"},{"key":"ref22","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-27252-8_2","article-title":"Structural pattern recognition with graph edit distance","author":"riesen","year":"2015","journal-title":"Advances in computer vision and pattern recognition Cham"},{"key":"ref21","first-page":"314","article-title":"Improving approximate graph edit distance by means of a greedy swap strategy","author":"riesen","year":"2015","journal-title":"International Conference on Image and Signal Processing"},{"key":"ref24","article-title":"A parallel graph edit distance algorithm","author":"abu-aisheh","year":"2017","journal-title":"Expert Systems with Applications"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2016.10.001"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10044-008-0141-y"}],"event":{"name":"2019 IEEE 35th International Conference on Data Engineering Workshops (ICDEW)","location":"Macao, Macao","start":{"date-parts":[[2019,4,8]]},"end":{"date-parts":[[2019,4,12]]}},"container-title":["2019 IEEE 35th International Conference on Data Engineering Workshops (ICDEW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8743499\/8750905\/08750933.pdf?arnumber=8750933","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T03:14:22Z","timestamp":1657854862000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8750933\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/icdew.2019.000-7","relation":{},"subject":[],"published":{"date-parts":[[2019,4]]}}}