FPT-Algorithms for Computing Gromov-Hausdorff and Interleaving Distances Between Trees
From MaRDI portal
Publication:5075834
DOI10.4230/LIPIcs.ESA.2019.83OpenAlexW2979262743MaRDI QIDQ5075834
Yusu Wang, Elena Farahbakhsh Touli
Publication date: 11 May 2022
Full work available at URL: https://arxiv.org/abs/1811.02425
Metric spaces, metrizability (54E35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items
The ultrametric Gromov-Wasserstein distance ⋮ The Reeb graph edit distance is universal ⋮ Decorated merge trees for persistent topology
Cites Work
- Unnamed Item
- Categorified Reeb graphs
- Some properties of Gromov-Hausdorff distances
- A survey on tree edit distance and related problems
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs
- Alignment of trees -- an alternative to tree edit
- Some MAX SNP-hard results concerning unordered labeled trees
- The Reeb graph edit distance is universal
- Computational aspects of the Gromov-Hausdorff distance and its application in non-rigid shape matching
- Reeb graphs for shape analysis and applications
- A theoretical and computational framework for isometry invariant recognition of point cloud data
- Fitting Tree Metrics: Hierarchical Clustering and Phylogeny
- Measuring the Distance Between Merge Trees
- Computing the Gromov-Hausdorff Distance for Metric Trees
- Efficient Computation of Isometry‐Invariant Distances Between Surfaces
- On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)
- Topological quadrangulations of closed triangulated surfaces using the Reeb graph
- Metric embeddings with outliers
- Measuring Distance between Reeb Graphs
- Ordinal embeddings of minimum relaxation
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Metric structures for Riemannian and non-Riemannian spaces. Transl. from the French by Sean Michael Bates. With appendices by M. Katz, P. Pansu, and S. Semmes. Edited by J. LaFontaine and P. Pansu
