FPT-algorithms for computing Gromov-Hausdorff and interleaving distances between trees
From MaRDI portal
Publication:5075834
DOI10.4230/LIPICS.ESA.2019.83OpenAlexW2979262743MaRDI QIDQ5075834FDOQ5075834
Authors: Elena Farahbakhsh Touli, Yusu Wang 
Publication date: 11 May 2022
Full work available at URL: https://arxiv.org/abs/1811.02425
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Metric spaces, metrizability (54E35)
Cites Work
- On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)
- Measuring distance between Reeb graphs (extended abstract)
- A survey on tree edit distance and related problems
- Some MAX SNP-hard results concerning unordered labeled trees
- Reeb graphs for shape analysis and applications
- Categorified Reeb graphs
- Some properties of Gromov-Hausdorff distances
- 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
- Alignment of trees -- an alternative to tree edit
- Computational aspects of the Gromov-Hausdorff distance and its application in non-rigid shape matching
- A theoretical and computational framework for isometry invariant recognition of point cloud data
- Efficient Computation of Isometry‐Invariant Distances Between Surfaces
- Approximation algorithms for embedding general metrics into trees
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs
- Fitting Tree Metrics: Hierarchical Clustering and Phylogeny
- Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics
- Topological quadrangulations of closed triangulated surfaces using the Reeb graph
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Measuring the distance between merge trees
- The Reeb graph edit distance is universal
- Metric embeddings with outliers
Cited In (7)
- The Reeb graph edit distance is universal
- Measuring the distance between merge trees
- Determining the Hausdorff distance between trees in polynomial time
- FPT-algorithms for computing Gromov-Hausdorff and interleaving distances between trees
- The ultrametric Gromov-Wasserstein distance
- Labeled interleaving distance for Reeb graphs
- Decorated merge trees for persistent topology
This page was built for publication: FPT-algorithms for computing Gromov-Hausdorff and interleaving distances between trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075834)
