{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T21:48:58Z","timestamp":1771710538938,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"6-7","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Recognition Letters"],"published-print":{"date-parts":[[2001,5]]},"DOI":"10.1016\/s0167-8655(01)00022-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:01:49Z","timestamp":1027609309000},"page":"701-704","source":"Crossref","is-referenced-by-count":100,"title":["Graph distances using graph union"],"prefix":"10.1016","volume":"22","author":[{"given":"W.D.","family":"Wallis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Shoubridge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Kraetz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Ray","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8655(01)00022-8_BIB1","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"issue":"8","key":"10.1016\/S0167-8655(01)00022-8_BIB2","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1016\/S0167-8655(97)00060-3","article-title":"On a relation between graph edit distance and maximum common subgraph","volume":"18","author":"Bunke","year":"1997","journal-title":"Pattern Recognition Lett."},{"issue":"1","key":"10.1016\/S0167-8655(01)00022-8_BIB3","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1142\/S0218001497000081","article-title":"Recent advances in graph matching","volume":"11","author":"Bunke","year":"1997","journal-title":"Internat. J. Pattern Recognition Artificial Intell."},{"key":"10.1016\/S0167-8655(01)00022-8_BIB4","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0167-8655(97)00179-7","article-title":"A graph distance metric based on the maximal common subgraph","volume":"19","author":"Bunke","year":"1998","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/S0167-8655(01)00022-8_BIB5","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/321556.321562","article-title":"An efficient algorithm for graph isomorphism","volume":"17","author":"Corneil","year":"1970","journal-title":"J. ACM"},{"issue":"11","key":"10.1016\/S0167-8655(01)00022-8_BIB6","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1109\/34.42855","article-title":"Stereo correspondence through feature grouping and maximal cliques","volume":"11","author":"Horaud","year":"1989","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"10.1016\/S0167-8655(01)00022-8_BIB7","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1016\/0898-1221(92)90125-2","article-title":"Pattern associativity and the retrieval of semantic networks","volume":"23","author":"Levinson","year":"1992","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/S0167-8655(01)00022-8_BIB8","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1080\/09528139208953741","article-title":"Conceptual graph matching: a flexible algorithm and experiments","volume":"4","author":"Myaeng","year":"1992","journal-title":"J. Experiment Theoret. Artificial Intell."},{"key":"10.1016\/S0167-8655(01)00022-8_BIB9","series-title":"Timing Space and Spacing Time, volume 2: Human Activity and Time Geography","first-page":"75","article-title":"Graph theory and the study of activity structure","author":"Parkes","year":"1978"},{"key":"10.1016\/S0167-8655(01)00022-8_BIB10","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","article-title":"A distance measure between attributed relational graphs for pattern recognition","volume":"13","author":"Sanfeliu","year":"1983","journal-title":"IEEE Trans. Systems Man. Cybernet."},{"key":"10.1016\/S0167-8655(01)00022-8_BIB11","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0378-8733(94)00249-A","article-title":"Models for evolving fixed node networks: model fitting and model testing","volume":"17","author":"Sanil","year":"1995","journal-title":"Social Networks"},{"issue":"1","key":"10.1016\/S0167-8655(01)00022-8_BIB12","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1006\/cviu.1997.0637","article-title":"Quantitative measures of change based on feature organization: eigenvalues and eigenvectors","volume":"71","author":"Sarkar","year":"1998","journal-title":"Computer Vision Image Understanding"},{"key":"10.1016\/S0167-8655(01)00022-8_BIB13","doi-asserted-by":"crossref","unstructured":"Shoubridge, P., Kraetzl, M., Ray, D., 1999a. Detection of abnormal change in dynamic networks. In: IEEE Information, Decision and Control, IDC '99 Conference, Adelaide, Australia, pp. 557\u2013562","DOI":"10.1109\/IDC.1999.754216"},{"key":"10.1016\/S0167-8655(01)00022-8_BIB14","unstructured":"Shoubridge, P.J., Kraetzl, M., Bunke, H., Wallis, W.D., 1999b. Approaches to Measuring Network Change. In: Proceedings of the DASPII, LaSalle, IL"},{"issue":"1","key":"10.1016\/S0167-8655(01)00022-8_BIB15","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321921.321925","article-title":"An algorithm for subgraph isomorphism","volume":"23","author":"Ullman","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/S0167-8655(01)00022-8_BIB16","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1109\/34.6778","article-title":"An eigendecomposition approach to weighted graph matching problems","volume":"10","author":"Umeyama","year":"1988","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865501000228?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865501000228?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T17:53:22Z","timestamp":1556387602000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167865501000228"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":16,"journal-issue":{"issue":"6-7","published-print":{"date-parts":[[2001,5]]}},"alternative-id":["S0167865501000228"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8655(01)00022-8","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}