{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:26:48Z","timestamp":1742401608055},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642341656"},{"type":"electronic","value":"9783642341663"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-34166-3_10","type":"book-chapter","created":{"date-parts":[[2012,10,22]],"date-time":"2012-10-22T09:27:14Z","timestamp":1350898034000},"page":"89-97","source":"Crossref","is-referenced-by-count":5,"title":["Complexity of Computing Distances between Geometric Trees"],"prefix":"10.1007","author":[{"given":"Aasa","family":"Feragen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-3","key":"10_CR1","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.tcs.2004.12.030","volume":"337","author":"P. Bille","year":"2005","unstructured":"Bille, P.: A survey on tree edit distance and related problems. Theor. Comput. Sci.\u00a0337(1-3), 217\u2013239 (2005)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Bridson, M.R., Haefliger, A.: Metric spaces of non-positive curvature. Springer (1999)","key":"10_CR2","DOI":"10.1007\/978-3-662-12494-9"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1644015.1644017","volume":"6","author":"E.D. Demaine","year":"2009","unstructured":"Demaine, E.D., Mozes, S., Rossman, B., Weimann, O.: An optimal decomposition algorithm for tree edit distance. ACM Trans. Algorithms\u00a06, 2:1\u20132:19 (2009)","journal-title":"ACM Trans. Algorithms"},{"issue":"5","key":"10_CR4","doi-asserted-by":"publisher","first-page":"944","DOI":"10.1109\/TPAMI.2008.267","volume":"31","author":"F. Demirci","year":"2009","unstructured":"Demirci, F., Shokoufandeh, A., Dickinson, S.J.: Skeletal shape abstraction from examples. TPAMI\u00a031(5), 944\u2013952 (2009)","journal-title":"TPAMI"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s10851-009-0157-y","volume":"35","author":"M. Demirci","year":"2009","unstructured":"Demirci, M., Platel, B., Shokoufandeh, A., Florack, L., Dickinson, S.: The representation and matching of images using top points. JMIV\u00a035, 103\u2013116 (2009)","journal-title":"JMIV"},{"doi-asserted-by":"crossref","unstructured":"Feragen, A., Hauberg, S., Nielsen, M., Lauze, F.: Means in spaces of tree-like shapes. In: ICCV (2011)","key":"10_CR6","DOI":"10.1109\/ICCV.2011.6126311"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-19309-5_13","volume-title":"Computer Vision \u2013 ACCV 2010","author":"A. Feragen","year":"2011","unstructured":"Feragen, A., Lauze, F., Lo, P., de Bruijne, M., Nielsen, M.: Geometries on Spaces of Treelike Shapes. In: Kimmel, R., Klette, R., Sugimoto, A. (eds.) ACCV 2010, Part II. LNCS, vol.\u00a06493, pp. 160\u2013173. Springer, Heidelberg (2011)"},{"unstructured":"Garey, M.J., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman (1979)","key":"10_CR8"},{"unstructured":"Klein, P., Tirthapura, S., Sharvit, D., Kimia, B.: A tree-edit-distance algorithm for comparing simple, closed shapes. In: SODA, pp. 696\u2013704 (2000)","key":"10_CR9"},{"unstructured":"Klein, P.N., Sebastian, T.B., Kimia, B.B.: Shape matching using edit-distance: an implementation. In: SODA, pp. 781\u2013790 (2001)","key":"10_CR10"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/3-540-68530-8_8","volume-title":"Algorithms - ESA \u201998","author":"P.N. Klein","year":"1998","unstructured":"Klein, P.N.: Computing the Edit-Distance between Unrooted Ordered Trees. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol.\u00a01461, p. 91. Springer, Heidelberg (1998)"},{"issue":"1-3","key":"10_CR12","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0012-365X(92)90687-B","volume":"108","author":"J. Matou\u0161ek","year":"1992","unstructured":"Matou\u0161ek, J., Thomas, R.: On the complexity of finding iso- and other morphisms for partial k-trees. Discrete Mathematics\u00a0108(1-3), 343\u2013364 (1992)","journal-title":"Discrete Mathematics"},{"key":"10_CR13","first-page":"923","volume":"27","author":"J.H. Metzen","year":"2009","unstructured":"Metzen, J.H., Kr\u00f6ger, T., Schenk, A., Zidowitz, S., Peitgen, H.-O., Jiang, X.: Matching of anatomical tree structures for registration of medical images. Im.\u00a0Vis.\u00a0Comp.\u00a027, 923\u2013933 (2009)","journal-title":"Im.\u00a0Vis.\u00a0Comp."},{"issue":"7","key":"10_CR14","first-page":"950","volume":"27","author":"K. Riesen","year":"2009","unstructured":"Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Im.\u00a0Vis.\u00a0Comp.\u00a027(7), 950\u2013959 (2009)","journal-title":"Im.\u00a0Vis.\u00a0Comp."},{"issue":"5","key":"10_CR15","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1109\/TPAMI.2004.1273924","volume":"26","author":"T.B. Sebastian","year":"2004","unstructured":"Sebastian, T.B., Klein, P.N., Kimia, B.B.: Recognition of shapes by editing their shock graphs. TPAMI\u00a026(5), 550\u2013571 (2004)","journal-title":"TPAMI"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"K.-C. Tai","year":"1979","unstructured":"Tai, K.-C.: The tree-to-tree correction problem. J. ACM\u00a026, 422\u2013433 (1979)","journal-title":"J. ACM"},{"issue":"3","key":"10_CR17","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s11263-006-8929-y","volume":"72","author":"A. Torsello","year":"2007","unstructured":"Torsello, A., Robles-Kelly, A., Hancock, E.R.: Discovering shape classes using tree edit-distance and pairwise clustering. IJCV\u00a072(3), 259\u2013285 (2007)","journal-title":"IJCV"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/11496656_29","volume-title":"Combinatorial Pattern Matching","author":"H. Touzet","year":"2005","unstructured":"Touzet, H.: A Linear Tree Edit Distance Algorithm for Similar Ordered Trees. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol.\u00a03537, pp. 334\u2013345. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Trinh, N., Kimia, B.: Skeleton search: Category-specific object recognition and segmentation using a skeletal shape model. IJCV, 1\u201326 (2011)","key":"10_CR19","DOI":"10.1007\/s11263-010-0412-0"},{"issue":"12","key":"10_CR20","first-page":"1540","volume":"24","author":"J. Tschirren","year":"2005","unstructured":"Tschirren, J., McLennan, G., Pal\u00e1gyi, K., Hoffman, E.A., Sonka, M.: Matching and anatomical labeling of human airway tree. TMI\u00a024(12), 1540\u20131547 (2005)","journal-title":"TMI"},{"issue":"27-28","key":"10_CR21","first-page":"375","volume":"139","author":"E.R. Weibel","year":"2009","unstructured":"Weibel, E.R.: What makes a good lung? Swiss Med.\u00a0Weekly\u00a0139(27-28), 375\u2013386 (2009)","journal-title":"Swiss Med.\u00a0Weekly"},{"issue":"3","key":"10_CR22","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. Inf. Process. Lett.\u00a042(3), 133\u2013139 (1992)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34166-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:05:49Z","timestamp":1558314349000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34166-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642341656","9783642341663"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34166-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}