{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:33:55Z","timestamp":1759638835291},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662489703"},{"type":"electronic","value":"9783662489710"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48971-0_45","type":"book-chapter","created":{"date-parts":[[2015,11,26]],"date-time":"2015-11-26T04:00:57Z","timestamp":1448510457000},"page":"529-540","source":"Crossref","is-referenced-by-count":8,"title":["Computing the Gromov-Hausdorff Distance for Metric Trees"],"prefix":"10.1007","author":[{"given":"Pankaj K.","family":"Agarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyle","family":"Fox","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhinandan","family":"Nath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anastasios","family":"Sidiropoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yusu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,27]]},"reference":[{"key":"45_CR1","unstructured":"Agarwal, P.K., Fox, K., Nath, A., Sidiropoulos, A., Wang, Y.: Computing the Gromov-Hausdorff distance for metric trees (2015). CoRR, \n                      abs\/1509.05751"},{"key":"45_CR2","volume-title":"The Design and Analysis of Computer Algorithms","author":"AV Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)"},{"key":"45_CR3","doi-asserted-by":"crossref","unstructured":"Bauer, U., Ge, X., Wang, Y.: Measuring distance between Reeb graphs. In: 30th Annual Symposium on Computational Geometry, p. 464 (2014)","DOI":"10.1145\/2582112.2582169"},{"issue":"5","key":"45_CR4","doi-asserted-by":"publisher","first-page":"1812","DOI":"10.1137\/050639296","volume":"28","author":"AM Bronstein","year":"2006","unstructured":"Bronstein, A.M., Bronstein, M.M., Kimmel, R.: Efficient computation of isometry-invariant distances between surfaces. SIAM J. Sci. Comput. 28(5), 1812\u20131836 (2006)","journal-title":"SIAM J. Sci. Comput."},{"key":"45_CR5","doi-asserted-by":"publisher","DOI":"10.1090\/gsm\/033","volume-title":"A Course in Metric Geometry","author":"D Burago","year":"2001","unstructured":"Burago, D., Burago, Y., Ivanov, S.: A Course in Metric Geometry. American Mathematical Society, Providence (2001)"},{"key":"45_CR6","first-page":"1425","volume":"11","author":"G Carlsson","year":"2010","unstructured":"Carlsson, G., M\u00e9moli, F.: Characterization, stability and convergence of hierarchical clustering methods. J. Mach. Learn. Res. 11, 1425\u20131470 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"45_CR7","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s00454-006-1276-5","volume":"37","author":"D Cohen-Steiner","year":"2007","unstructured":"Cohen-Steiner, D., Edelsbrunner, H., Harer, J.: Stability of persistence diagrams. Disc. Comput. Geom. 37(1), 103\u2013120 (2007)","journal-title":"Disc. Comput. Geom."},{"key":"45_CR8","unstructured":"de Silva, V., Munch, E., Patel, A.: Categorification of Reeb graphs, Preprint (2014)"},{"key":"45_CR9","volume-title":"Metric Structures for Riemannian and Non-Riemannian Spaces","author":"M Gromov","year":"2007","unstructured":"Gromov, M.: Metric Structures for Riemannian and Non-Riemannian Spaces. Birkh\u00e4user Basel, Basel (2007)"},{"key":"45_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/11538462_10","volume-title":"Approximation, Randomization and Combinatorial Optimization","author":"A Hall","year":"2005","unstructured":"Hall, A., Papadimitriou, C.: Approximating the distortion. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX 2005 and RANDOM 2005. LNCS, vol. 3624, pp. 111\u2013122. Springer, Heidelberg (2005)"},{"issue":"4","key":"45_CR11","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An \n                      \n                        \n                      \n                      $$n^{5\/2}$$\n                     algorithm for maximum matchings in bipartite graphs. SIAM J. Comp. 2(4), 225\u2013231 (1973)","journal-title":"SIAM J. Comp."},{"issue":"4","key":"45_CR12","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1137\/080712921","volume":"39","author":"C Kenyon","year":"2009","unstructured":"Kenyon, C., Rabani, Y., Sinclair, A.: Low distortion maps between point sets. SIAM J. Comp. 39(4), 1617\u20131636 (2009)","journal-title":"SIAM J. Comp."},{"key":"45_CR13","unstructured":"Memoli, F.: On the use of Gromov-Hausdorff distances for shape comparison. In: Eurographics Symposium on Point-Based Graphics (2007)"},{"issue":"3","key":"45_CR14","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10208-004-0145-y","volume":"5","author":"F M\u00e9moli","year":"2005","unstructured":"M\u00e9moli, F., Sapiro, G.: A theoretical and computational framework for isometry invariant recognition of point cloud data. Found. Comput. Math. 5(3), 313\u2013347 (2005)","journal-title":"Found. Comput. Math."},{"key":"45_CR15","doi-asserted-by":"crossref","unstructured":"Morozov, D., Beketayev, K., Weber, G.H.: Interleaving distance between merge trees. In: Workshop on Topological Methods in Data Analysis and Visualization: Theory, Algorithms and Applications (2013)","DOI":"10.1007\/978-3-319-04099-8_10"},{"key":"45_CR16","unstructured":"Papadimitriou, C., Safra, S.: The complexity of low-distortion embeddings between point sets. In: 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 112\u2013118 (2005)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48971-0_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T17:54:06Z","timestamp":1559325246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48971-0_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662489703","9783662489710"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48971-0_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}