{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T13:35:56Z","timestamp":1648560956762},"reference-count":3,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2012,8,14]],"date-time":"2012-08-14T00:00:00Z","timestamp":1344902400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s00373-012-1213-8","type":"journal-article","created":{"date-parts":[[2012,8,13]],"date-time":"2012-08-13T02:14:39Z","timestamp":1344824079000},"page":"1391-1402","source":"Crossref","is-referenced-by-count":0,"title":["On Distance Between Graphs"],"prefix":"10.1007","volume":"29","author":[{"given":"Alexander","family":"Halperin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colton","family":"Magnant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel M.","family":"Martin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,8,14]]},"reference":[{"key":"1213_CR1","doi-asserted-by":"crossref","unstructured":"K\u00f6bler, J., Sch\u00f6ning, U., Tor\u00e1n, J.: The graph isomorphism problem: its structural complexity. In: Progress in Theoretical Computer Science. Birkh\u00e4user Boston Inc., Boston (1993)","DOI":"10.1007\/978-1-4612-0333-9"},{"issue":"1\u20132","key":"1213_CR2","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s000100050025","volume":"55","author":"G. Chartrand","year":"1998","unstructured":"Chartrand G., Kubicki G., Schultz M.: Graph similarity and distance in graphs. Aequationes Math. 55(1\u20132), 129\u2013145 (1998)","journal-title":"Aequationes Math."},{"issue":"5\u20136","key":"1213_CR3","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1016\/j.disc.2007.07.047","volume":"308","author":"M. G. Gor\u0161e Pihler","year":"2008","unstructured":"Gor\u0161e Pihler M. G., \u017derovnik J.: Partial cubes are distance graphs. Discrete Math. 308(5\u20136), 820\u2013826 (2008)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1213-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1213-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1213-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:59:34Z","timestamp":1559041174000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1213-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,14]]},"references-count":3,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["1213"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1213-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,14]]}}}