{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:06Z","timestamp":1750306746784,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,11,5]],"date-time":"2013-11-05T00:00:00Z","timestamp":1383609600000},"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":[[2013,11,5]]},"DOI":"10.1145\/2525314.2525350","type":"proceedings-article","created":{"date-parts":[[2014,1,14]],"date-time":"2014-01-14T13:40:06Z","timestamp":1389706806000},"page":"224-233","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient geometric graph matching using vertex embedding"],"prefix":"10.1145","author":[{"given":"Ayser","family":"Armiti","sequence":"first","affiliation":[{"name":"Heidelberg University, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Gertz","sequence":"additional","affiliation":[{"name":"Heidelberg University, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,11,5]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Distort geometric graphs. https:\/\/code.google.com\/p\/itgrag\/.  Distort geometric graphs. https:\/\/code.google.com\/p\/itgrag\/."},{"key":"e_1_3_2_1_2_1","unstructured":"Road networks dataset. http:\/\/www.cs.utah.edu\/~lifeifei\/SpatialDataset.htm.  Road networks dataset. http:\/\/www.cs.utah.edu\/~lifeifei\/SpatialDataset.htm."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1018429.1020992"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2011.04.017"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1888150.1888189"},{"key":"e_1_3_2_1_6_1","first-page":"398","volume-title":"CVPR","author":"Cho M.","year":"2012","unstructured":"M. Cho and K. M. Lee . Progressive graph matching: Making a move of graphs via probabilistic voting . In CVPR , pages 398 -- 405 , 2012 . M. Cho and K. M. Lee. Progressive graph matching: Making a move of graphs via probabilistic voting. In CVPR, pages 398--405, 2012."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003228"},{"issue":"2","key":"e_1_3_2_1_8_1","first-page":"112","article-title":"Algorithms for the reduction of the number of points required to represent a digitized line or its caricature","volume":"10","author":"Douglas D. H.","year":"1973","unstructured":"D. H. Douglas and T. K. Peuker . Algorithms for the reduction of the number of points required to represent a digitized line or its caricature . The Canadian Geographer , 10 ( 2 ): 112 -- 122 , 1973 . D. H. Douglas and T. K. Peuker. Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. The Canadian Geographer, 10(2):112--122, 1973.","journal-title":"The Canadian Geographer"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1984.6313232"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10044-008-0141-y"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1195989"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02124-4_15"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/844380.844733"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(90)90109-B"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0105003"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2005.06.012"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.10.011"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2008.04.004"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1855255"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0_7"},{"key":"e_1_3_2_1_21_1","volume-title":"NICTA","author":"Sanderson C.","year":"2010","unstructured":"C. Sanderson . Armadillo : An open source C++ linear algebra library for fast prototyping and computationally intensive experiments. Technical report , NICTA , Australia , October 2010 . C. Sanderson. Armadillo: An open source C++ linear algebra library for fast prototyping and computationally intensive experiments. Technical report, NICTA, Australia, October 2010."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1983.6313167"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1098\/rspb.1991.0045","article-title":"An algorithm for associating the features of two images","volume":"244","author":"Scott G. L.","year":"1991","unstructured":"G. L. Scott and H. C. L. Higgins . An algorithm for associating the features of two images . Proceedings of Royal Society of London , B-244 : 21 -- 26 , 1991 . G. L. Scott and H. C. L. Higgins. An algorithm for associating the features of two images. Proceedings of Royal Society of London, B-244:21--26, 1991.","journal-title":"Proceedings of Royal Society of London"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.6778"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/321796.321811"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2009.01.004"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687631"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.4108\/icst.collaboratecom.2011.247162"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063831"}],"event":{"name":"SIGSPATIAL'13: 21st SIGSPATIAL International Conference on Advances in Geographic Information Systems","sponsor":["SIGSPATIAL ACM Special Interest Group on Spatial Information","SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques"],"location":"Orlando Florida","acronym":"SIGSPATIAL'13"},"container-title":["Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2525314.2525350","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2525314.2525350","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:23Z","timestamp":1750231703000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2525314.2525350"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,5]]},"references-count":29,"alternative-id":["10.1145\/2525314.2525350","10.1145\/2525314"],"URL":"https:\/\/doi.org\/10.1145\/2525314.2525350","relation":{},"subject":[],"published":{"date-parts":[[2013,11,5]]},"assertion":[{"value":"2013-11-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}