Fetching the paper…
Reading the bibliography…
The Gromov-Hausdorff distance ($d_\mathrm{GH}$) provides a natural way of quantifying the dissimilarity between two given metric spaces.
Mathematical Taxonomy
Nicholas Jardine and Robin Sibson · 1971
Earlier work this paper cites.
The design and analysis of computer algorithms
Alfred V Aho and John E Hopcroft · 1974
Earlier work this paper cites.
The structure of superspace
David A Edwards · 1975
Earlier work this paper cites.
Groups of polynomial growth and expanding maps (with an appendix by Jacques Tits)
Mikhail Gromov · 1981
Earlier work this paper cites.
The complexity of ultrametric partitions on graphs
Mirko Křivánek · 1988
Earlier work this paper cites.
Quadratic Assignment and Related Problems: DIMACS Workshop, May 20-21, 1993
Panos M Pardalos, Henry Wolkowicz, et al · 1994
Earlier work this paper cites.
Probabilistic approximation of metric spaces and its algorithmic applications
Yair Bartal · 1996
Earlier work this paper cites.
A course in metric geometry
Dmitri Burago, Yuri Burago, and Sergei Ivanov · 2001
Earlier work this paper cites.
Phylogenetics
Charles Semple and Mike Steel · 2003
Earlier work this paper cites.
Ihor Zarichnyi · 2005
Earlier work this paper cites.
The C programming language
Brian W Kernighan and Dennis M Ritchie · 2006
Earlier work this paper cites.
Riemannian geometry
Peter Petersen, S Axler, and KA Ribet · 2006
Earlier work this paper cites.
Metric structures for Riemannian and non-Riemannian spaces
Mikhail Gromov · 2007
Earlier work this paper cites.
On the use of Gromov-Hausdorff distances for shape comparison
Facundo Mémoli · 2007
Earlier work this paper cites.
Gromov-hausdorff stable signatures for shapes using persistence
Frédéric Chazal, David Cohen-Steiner, Leonidas J Guibas, Facundo Mémoli, and Steve Y Oudot · 2009
Earlier work this paper cites.
Introduction to algorithms
Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein · 2009
Cited alongside, same era.
Geometry of non-archimedean Gromov-Hausdorff distance
Derong Qiu · 2009
Cited alongside, same era.
A Gromov-Hausdorff framework with diffusion geometry for topologically-robust non-rigid shape matching
Alexander M Bronstein, Michael M Bronstein, Ron Kimmel, Mona Mahmoudi, and Guillermo Sapiro · 2010
Cited alongside, same era.
Characterization, stability and convergence of hierarchical clustering methods
Gunnar Carlsson and Facundo Mémoli · 2010
Cited alongside, same era.
Modern hierarchical, agglomerative clustering algorithms
Daniel Müllner · 2011
Cited alongside, same era.
Characterizing (quasi-) ultrametric finite spaces in terms of (directed) graphs
Hierarchical representations of network data with optimal distortion bounds
Zane Smith, Samir Chowdhury, and Facundo Mémoli · 2016
Later among the works it cites.
Computational aspects of the Gromov–Hausdorff distance and its application in non-rigid shape matching
Felix Schmiedl · 2017
Later among the works it cites.
Computing the Gromov-Hausdorff distance for metric trees
Pankaj K Agarwal, Kyle Fox, Abhinandan Nath, Anastasios Sidiropoulos, and Yusu Wang · 2018
Later among the works it cites.
Explicit geodesics in Gromov-Hausdorff space
Samir Chowdhury and Facundo Mémoli · 2018
Later among the works it cites.
A metric on phylogenetic tree shapes
Caroline Colijn and Giacomo Plazzotta · 2018
Later among the works it cites.
From isomorphic rooted trees to isometric ultrametric spaces
Oleksiy Dovgoshey and Evgeniy Petrov · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Vladimir Gurvich and Mikhail Vyalyi · 2012
Cited alongside, same era.
Some properties of Gromov-Hausdorff distances
Facundo Mémoli · 2012
Cited alongside, same era.
Interleaving distance between merge trees
Dmitriy Morozov, Kenes Beketayev, and Gunther Weber · 2013
Cited alongside, same era.
On the Gomory–Hu inequality
Evgenii A Petrov and Aleksei A Dovgoshey · 2014
Cited alongside, same era.
The Gromov-Hausdorff metric on the space of compact metric spaces is strictly intrinsic
Alexandr Ivanov, Nadezhda Nikolaeva, and Alexey Tuzhilin · 2015
Cited alongside, same era.
A geometric study of Wasserstein spaces: ultrametrics
Benoît R Kloeckner · 2015
Cited alongside, same era.
Ultrametric distance in syntax
Mark D. Roberts · 2015
Cited alongside, same era.
Formigrams: Clustering summaries of dynamic data
Woojin Kim and Facundo Mémoli · 2018
Later among the works it cites.
New Gromov-inspired metrics on phylogenetic tree space
Volkmar Liebscher · 2018
Later among the works it cites.
https://github.com/ndag/ultrametrics , 2019
Github repository · 2019
Later among the works it cites.
FPT-algorithms for computing Gromov-Hausdorff and interleaving distances between trees
Elena Farahbakhsh Touli and Yusu Wang · 2019
Later among the works it cites.
Intrinsic interleaving distance for merge trees
Ellen Gasparovic, Elizabeth Munch, Steve Oudot, Katharine Turner, Bei Wang, and Yusu Wang · 2019
Later among the works it cites.
The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics
Manuel Lafond, Nadia El-Mabrouk, Katharina T Huber, and Vincent Moulton · 2019
Later among the works it cites.
Approximating gromov-hausdorff distance in euclidean space
Sushovan Majhi, Jeffrey Vitter, and Carola Wenk · 2019
Later among the works it cites.
Gromov-Hausdorff distances on p p -metric spaces and ultrametric spaces
Facundo Mémoli, Zane Smith, and Zhengchao Wan · 2019
Later among the works it cites.