{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:31:11Z","timestamp":1758267071975},"reference-count":28,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1109\/icpr.2018.8546055","type":"proceedings-article","created":{"date-parts":[[2018,11,30]],"date-time":"2018-11-30T00:17:38Z","timestamp":1543537058000},"page":"934-939","source":"Crossref","is-referenced-by-count":4,"title":["Quasimetric Graph Edit Distance as a Compact Quadratic Assignment Problem"],"prefix":"10.1109","author":[{"given":"David B.","family":"Blumenthal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evariste","family":"Daller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastien","family":"Bougleux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luc","family":"Brun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johann","family":"Gamper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11656-3_11"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21024-7_2"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2006.152"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2018.03.032"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2008.04.004"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.57"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2772243"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2349924"},{"key":"ref18","first-page":"73","article-title":"Approximate graph edit distance guided by bipartite matching of bags of walks","author":"ga\u00fcz\u00e8re","year":"2014","journal-title":"S+SSPR"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18224-7_19"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2017.10.007"},{"key":"ref4","first-page":"211","article-title":"Exact computation of graph edit distance for uniform and non-uniform metric edit costs","author":"blumenthal","year":"2017","journal-title":"GbRPR"},{"key":"ref27","first-page":"242","article-title":"A survey on applications of bipartite graph edit distance","author":"stauffer","year":"2017","journal-title":"GbRPR"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.5220\/0005209202710278"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2017.07.029"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498246"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44415-3_7"},{"key":"ref7","first-page":"163","article-title":"Fast suboptimal algorithms for the computation of graph edit distance","author":"neuhaus","year":"2006","journal-title":"S+SSPR"},{"key":"ref2","first-page":"21","article-title":"Speeding up graph edit distance computation with a bipartite heuristic","author":"riesen","year":"2007","journal-title":"MLG"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2014.07.015"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687631"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2014.04.015"},{"key":"ref22","first-page":"496","article-title":"Approximating graph edit distance using GNCCP","author":"ga\u00fcz\u00e8re","year":"2016","journal-title":"S+SSPR"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1142\/S021800141550010X"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.5220\/0006599901490158"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2016.10.001"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TMI.2012.2230186"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2016.7899881"}],"event":{"name":"2018 24th International Conference on Pattern Recognition (ICPR)","start":{"date-parts":[[2018,8,20]]},"location":"Beijing","end":{"date-parts":[[2018,8,24]]}},"container-title":["2018 24th International Conference on Pattern Recognition (ICPR)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8527858\/8545020\/08546055.pdf?arnumber=8546055","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T05:10:29Z","timestamp":1643260229000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8546055\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/icpr.2018.8546055","relation":{},"subject":[],"published":{"date-parts":[[2018,8]]}}}