{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:14:41Z","timestamp":1750306481274,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,9,28]],"date-time":"2015-09-28T00:00:00Z","timestamp":1443398400000},"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":[[2015,9,28]]},"DOI":"10.1145\/2815782.2815792","type":"proceedings-article","created":{"date-parts":[[2015,12,18]],"date-time":"2015-12-18T14:32:43Z","timestamp":1450449163000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Edit Distance-based Digraph Similarity"],"prefix":"10.1145","author":[{"given":"Ilicia","family":"Jordaan","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Pretoria, Pretoria, South Africa"}]},{"given":"Linda","family":"Marshall","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Pretoria, Pretoria, South Africa"}]}],"member":"320","published-online":{"date-parts":[[2015,9,28]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1049\/ip-sen:20041180"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1481153"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544886"},{"key":"e_1_3_2_1_4_1","volume-title":"Graph Theory","author":"Diestel R.","year":"2005","unstructured":"R. Diestel . Graph Theory . Springer-Verlag , 3 edition, 2005 . R. Diestel. Graph Theory. Springer-Verlag, 3 edition, 2005."},{"key":"e_1_3_2_1_5_1","unstructured":"Gale. \"Graphs\"World of Computer Science 2007.  Gale. \"Graphs\"World of Computer Science 2007."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10044-008-0141-y"},{"key":"e_1_3_2_1_7_1","volume-title":"memory efficient Levenshtein algorithm","author":"Hjelmqvist S.","year":"2012","unstructured":"S. Hjelmqvist . Fast , memory efficient Levenshtein algorithm , 2012 . Online: http:\/\/www.codeproject.com\/Articles\/13525\/Fast-memory-efficient-Levenshtein-algorithm. Accessed 25 August 2015. S. Hjelmqvist. Fast, memory efficient Levenshtein algorithm, 2012. Online: http:\/\/www.codeproject.com\/Articles\/13525\/Fast-memory-efficient-Levenshtein-algorithm. Accessed 25 August 2015."},{"key":"e_1_3_2_1_8_1","volume-title":"Algorithms for graph similarity and subgraph matching","author":"Koutra D.","year":"2011","unstructured":"D. Koutra , A. Parikh , A. Ramdas , and J. Xiang . Algorithms for graph similarity and subgraph matching , 2011 . Online: https:\/\/www.cs.cmu.edu\/~jingx\/docs\/DBreport.pdf Accessed 25 August 2015. D. Koutra, A. Parikh, A. Ramdas, and J. Xiang. Algorithms for graph similarity and subgraph matching, 2011. Online: https:\/\/www.cs.cmu.edu\/~jingx\/docs\/DBreport.pdf Accessed 25 August 2015."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.862201"},{"key":"e_1_3_2_1_11_1","first-page":"25","volume-title":"SPIE International Symposium on Voice, Video, and Data Communications","author":"Tirthapura S.","year":"1998","unstructured":"S. Tirthapura , D. Sharvit , P. Klein , and B. Kimia . Indexing based on edit-distance matching of shape graphs . In SPIE International Symposium on Voice, Video, and Data Communications , pages 25 -- 36 , 1998 . S. Tirthapura, D. Sharvit, P. Klein, and B. Kimia. Indexing based on edit-distance matching of shape graphs. In SPIE International Symposium on Voice, Video, and Data Communications, pages 25--36, 1998."},{"key":"e_1_3_2_1_12_1","volume-title":"Graph similarity and matching. Master's thesis","author":"Zager L.","year":"2005","unstructured":"L. Zager . Graph similarity and matching. Master's thesis , Massachusetts Institute of Technology , 2005 . L. Zager. Graph similarity and matching. Master's thesis, Massachusetts Institute of Technology, 2005."}],"event":{"name":"SAICSIT '15: The 2015 Annual Research Conference of the South African Institute of Computer Scientists and Information Technologists","acronym":"SAICSIT '15","location":"Stellenbosch South Africa"},"container-title":["Proceedings of the 2015 Annual Research Conference on South African Institute of Computer Scientists and Information Technologists"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2815782.2815792","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2815782.2815792","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:22Z","timestamp":1750225702000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2815782.2815792"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,28]]},"references-count":11,"alternative-id":["10.1145\/2815782.2815792","10.1145\/2815782"],"URL":"https:\/\/doi.org\/10.1145\/2815782.2815792","relation":{},"subject":[],"published":{"date-parts":[[2015,9,28]]},"assertion":[{"value":"2015-09-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}