{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:27:25Z","timestamp":1742974045147,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540219811"},{"type":"electronic","value":"9783540246732"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24673-2_34","type":"book-chapter","created":{"date-parts":[[2011,1,12]],"date-time":"2011-01-12T18:59:46Z","timestamp":1294858786000},"page":"414-427","source":"Crossref","is-referenced-by-count":2,"title":["A Polynomial-Time Metric for Attributed Trees"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Torsello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D\u017eena","family":"Hidovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcello","family":"Pelillo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","volume-title":"Network Flows","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice-Hall, Upper Saddle River (1993)"},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0167-8655(97)00179-7","volume":"19","author":"H. Bunke","year":"1998","unstructured":"Bunke, H., Shearer, K.: A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters\u00a019, 255\u2013259 (1998)","journal-title":"Pattern Recognition Letters"},{"issue":"2","key":"34_CR3","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1109\/34.121788","volume":"14","author":"S.J. Dickinson","year":"1992","unstructured":"Dickinson, S.J., Pentland, A.P., Rosenfeld, A.: 3-D shape recovery using distributed aspect matching. PAMI\u00a014(2), 174\u2013198 (1992)","journal-title":"PAMI"},{"key":"34_CR4","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1109\/TPAMI.1986.4767835","volume":"8","author":"M.A. Eshera","year":"1986","unstructured":"Eshera, M.A., Fu, K.-S.: An image understanding system using attributed symbolic representation and in exact graph-matching. PAMI\u00a08, 604\u2013618 (1986)","journal-title":"PAMI"},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1016\/S0167-8655(01)00017-4","volume":"22","author":"M.L. Fernandez","year":"2001","unstructured":"Fernandez, M.L., Valiente, G.: A graph distacne metric combining maximum common subgraph and minimum common supergraph. Pattern Recognition Letters\u00a022, 753\u2013758 (2001)","journal-title":"Pattern Recognition Letters"},{"doi-asserted-by":"crossref","unstructured":"Hidovi\u0107, D., Pelillo, M.: Metrics for attributed graphs based on the maximal similarity common subgraph. Int. J. Pattern Recognition Artif. Intell. (2004) (in press)","key":"34_CR6","DOI":"10.1142\/S0218001404003216"},{"doi-asserted-by":"crossref","unstructured":"Ioffe, S., Forsyth, D.A.: Human tracking with mixtures of trees. In: Proc. ICCV, vol.\u00a0I, pp. 690\u2013695 (2001)","key":"34_CR7","DOI":"10.1109\/ICCV.2001.937589"},{"key":"34_CR8","volume-title":"Algorithms for Clustering Data","author":"A.K. Jain","year":"1988","unstructured":"Jain, A.K., Dubes, R.C.: Algorithms for Clustering Data. Prentice Hall, Englewood Cliffs (1988)"},{"key":"34_CR9","first-page":"273","volume":"10","author":"D.W. Matula","year":"1968","unstructured":"Matula, D.W.: An algorithm for subtree identification. SIAM Review\u00a010, 273\u2013274 (1968)","journal-title":"SIAM Review"},{"doi-asserted-by":"crossref","unstructured":"Pavan, M., Pelillo, M.: A new graph-theoretic approach to clustering and segmentation. In: Proc. CVPR, vol.\u00a0I, pp. 145\u2013152 (2003)","key":"34_CR10","DOI":"10.1109\/CVPR.2003.1211348"},{"issue":"11","key":"34_CR11","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1109\/34.809105","volume":"21","author":"M. Pelillo","year":"1999","unstructured":"Pelillo, M., Sidiqi, K., Zucker, S.W.: Matching hierarchical structures using association graphs. PAMI\u00a021(11), 1105\u20131120 (1999)","journal-title":"PAMI"},{"doi-asserted-by":"crossref","unstructured":"Peura, M.: Attribute trees in image analysis: Heuristic matching and learning techniques. In: Proc. Int. Conf. Image Anal. Processing, pp. 1160-1165 (1999)","key":"34_CR12","DOI":"10.1109\/ICIAP.1999.797760"},{"doi-asserted-by":"crossref","unstructured":"Sebastian, T.B., Klein, P.N., Kimia, B.B.: Recognition of shpes by editing their shock graphs. PAMI (2004) (to appear)","key":"34_CR13","DOI":"10.1109\/TPAMI.2004.1273924"},{"issue":"8","key":"34_CR14","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J. Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. PAMI\u00a022(8), 888\u2013905 (2000)","journal-title":"PAMI"},{"issue":"1","key":"34_CR15","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1023\/A:1008102926703","volume":"35","author":"K. Siddiqi","year":"1999","unstructured":"Siddiqi, K., Shokoufandeh, A., Dickinson, S.J., Zucker, S.W.: Shock graphs and shape matching. Int. J. Computer Vision\u00a035(1), 13\u201332 (1999)","journal-title":"Int. J. Computer Vision"},{"key":"34_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/3-540-45129-3_23","volume-title":"Visual Form 2001","author":"A. Torsello","year":"2001","unstructured":"Torsello, A., Hancock, E.R.: A skeletal measure of 2D shape similarity. In: Arcelli, C., Cordella, L.P., Sanniti di Baja, G. (eds.) IWVF 2001. LNCS, vol.\u00a02059, pp. 260\u2013271. Springer, Heidelberg (2001)"},{"key":"34_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/3-540-44745-8_29","volume-title":"Energy Minimization Methods in Computer Vision and Pattern Recognition","author":"A. Torsello","year":"2001","unstructured":"Torsello, A., Hancock, E.R.: Efficiently computing weighted tree edit-distance using relaxation labeling. In: Figueiredo, M., Zerubia, J., Jain, A.K. (eds.) EMMCVPR 2001. LNCS, vol.\u00a02134, pp. 438\u2013453. Springer, Heidelberg (2001)"},{"key":"34_CR18","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1109\/TSMC.1979.4310127","volume":"9","author":"W.H. Tsai","year":"1979","unstructured":"Tsai, W.H., Fu, K.-S.: Error-correcting isomorphism of attributed relational graphs for pattern analysis. IEEE Trans Syst. Man Cybern.\u00a09, 757\u2013768 (1979)","journal-title":"IEEE Trans Syst. Man Cybern."},{"doi-asserted-by":"crossref","unstructured":"Valiente, G.: An efficient bottom-up distance between trees. In: Proc. Int. Symp. String Processing Information Retrieval, pp. 212\u2013219 (2001)","key":"34_CR19","DOI":"10.1109\/SPIRE.2001.989761"},{"key":"34_CR20","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/S0167-8655(01)00022-8","volume":"22","author":"W.D. Wallis","year":"2001","unstructured":"Wallis, W.D., Shoubridge, P., Kraetz, M., Ray, D.: Graph distances using graph union. Pattern Recognition Letters\u00a022, 701\u2013704 (2001)","journal-title":"Pattern Recognition Letters"},{"key":"34_CR21","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0031-3203(99)00199-5","volume":"34","author":"J.T.-L. Wang","year":"2001","unstructured":"Wang, J.T.-L., Zhang, K.: Finding similar consesnus between trees: An algorithm and a distance hierarchy. Pattern Recognition\u00a034, 127\u2013137 (2001)","journal-title":"Pattern Recognition"},{"key":"34_CR22","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF01975866","volume":"15","author":"K. Zhang","year":"1996","unstructured":"Zhang, K.: A constrained edit-distance between unordered labeled trees. Algorithmica\u00a015, 205\u2013222 (1996)","journal-title":"Algorithmica"},{"key":"34_CR23","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K. Zhang","year":"1989","unstructured":"Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput.\u00a018, 1245\u20131262 (1989)","journal-title":"SIAM J. Comput."},{"key":"34_CR24","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(92)90136-J","volume":"42","author":"K. Zhang","year":"1992","unstructured":"Zhang, K., Statman, R., Shasha, D.: On the editing distance between unordered labeled trees. Inform. Process. Letters\u00a042, 133\u2013139 (1992)","journal-title":"Inform. Process. Letters"},{"issue":"1","key":"34_CR25","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1142\/S0129054196000051","volume":"7","author":"K. Zhang","year":"1996","unstructured":"Zhang, K., Wang, J.T.L., Shasha, D.: On the editing distance between undirected acyclic graphs. Int. J. Found. Computer Sci.\u00a07(1), 43\u201357 (1996)","journal-title":"Int. J. Found. Computer Sci."}],"container-title":["Lecture Notes in Computer Science","Computer Vision - ECCV 2004"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24673-2_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T17:17:06Z","timestamp":1740849426000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24673-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540219811","9783540246732"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24673-2_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}