{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T21:50:55Z","timestamp":1673387455684},"reference-count":27,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Patt. Recogn. Artif. Intell."],"published-print":{"date-parts":[[2004,5]]},"abstract":"<jats:p> A hierarchical abstraction scheme based on node contraction and two related similarity measures for graphs with unique node labels are proposed in this paper. The contraction scheme reduces the number of nodes in a graph and leads to a speed-up in the computation of graph similarity. Theoretical properties of the new graph similarity measures are derived and experimentally verified. A potential application of the proposed graph abstraction scheme in the domain of computer network monitoring is discussed. <\/jats:p>","DOI":"10.1142\/s021800140400323x","type":"journal-article","created":{"date-parts":[[2004,5,10]],"date-time":"2004-05-10T06:06:26Z","timestamp":1084169186000},"page":"425-442","source":"Crossref","is-referenced-by-count":6,"title":["SIMILARITY MEASURES FOR HIERARCHICAL REPRESENTATIONS OF GRAPHS WITH UNIQUE NODE LABELS"],"prefix":"10.1142","volume":"18","author":[{"given":"P. J.","family":"DICKINSON","sequence":"first","affiliation":[{"name":"ISR Division, DSTO,  P.O. Box 1500, Edinburgh SA 5111, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"KRAETZL","sequence":"additional","affiliation":[{"name":"ISR Division, DSTO,  P.O. Box 1500, Edinburgh SA 5111, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"BUNKE","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Bern, Neubr\u00fcckstr. 10, CH-3012 Bern, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"NEUHAUS","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Bern, Neubr\u00fcckstr. 10, CH-3012 Bern, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"DADEJ","sequence":"additional","affiliation":[{"name":"ITR, University of South Australia, Mawson Lakes Boulevard, Mawson Lakes, SA 5095, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","volume-title":"Computer Vision","author":"Ballard D.","year":"1982"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1109\/34.954600"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(97)00060-3"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1109\/34.400565"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(96)00123-9"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-70659-3_13"},{"key":"rf10","first-page":"101","volume":"12","author":"Kropatsch W.","journal-title":"Computing"},{"key":"rf11","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1017\/S0960129501003577","volume":"12","author":"Larrosa J.","journal-title":"Math. Struct. Comput. Sci."},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001490000022"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45869-7_26"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1109\/34.954603"},{"key":"rf15","doi-asserted-by":"crossref","first-page":"1120","DOI":"10.1109\/34.954602","volume":"23","author":"Luo B.","journal-title":"IEEE Trans. PAMI"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-70659-3_8"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-70659-3_1"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380120103"},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1109\/34.682179"},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1109\/34.809105"},{"key":"rf21","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(98)00110-X"},{"key":"rf22","first-page":"353","volume":"13","author":"Sanfeliu A.","journal-title":"IEEE Trans. SMC"},{"key":"rf23","doi-asserted-by":"publisher","DOI":"10.1142\/9789812775375_0001"},{"key":"rf24","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(00)00048-0"},{"key":"rf25","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"rf26","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2002.1017624"},{"key":"rf27","first-page":"588","volume":"27","author":"Wang I.","journal-title":"IEEE Trans. SMC"},{"key":"rf28","doi-asserted-by":"publisher","DOI":"10.1109\/34.601251"},{"key":"rf29","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(92)90111-U"},{"key":"rf30","first-page":"68","volume":"20","author":"Zahn C. T.","journal-title":"IEEE Trans. Comput."}],"container-title":["International Journal of Pattern Recognition and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S021800140400323X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T12:44:28Z","timestamp":1565181868000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S021800140400323X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,5]]},"references-count":27,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2004,5]]}},"alternative-id":["10.1142\/S021800140400323X"],"URL":"https:\/\/doi.org\/10.1142\/s021800140400323x","relation":{},"ISSN":["0218-0014","1793-6381"],"issn-type":[{"value":"0218-0014","type":"print"},{"value":"1793-6381","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,5]]}}}