Publication:3459891

DOI10.1007/978-3-662-48971-0_45zbMath1454.68173arXiv1509.05751OpenAlexW2921616690WikidataQ129953224 ScholiaQ129953224MaRDI QIDQ3459891

Yusu Wang, Abhinandan Nath, Anastasios Sidiropoulos, Kyle Fox, Pankaj K. Agarwal

Publication date: 11 January 2016

Published in: Algorithms and Computation, ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.05751

zbMATH Keywords

metric spacesembeddings

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (13)

On \(p\)-metric spaces and the \(p\)-Gromov-Hausdorff distance ⋮ Approximating Gromov-Hausdorff distance in Euclidean space ⋮ Distance distributions and inverse problems for metric measure spaces ⋮ The ultrametric Gromov-Wasserstein distance ⋮ The (homological) persistence of gerrymandering ⋮ Polynomial-Time Algorithms for Continuous Metrics on Atomic Clouds of Unordered Points ⋮ The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics ⋮ Spatiotemporal persistent homology for dynamic metric spaces ⋮ Distance measures for embedded graphs ⋮ New Gromov-inspired metrics on phylogenetic tree space ⋮ Computational Complexity of the Interleaving Distance ⋮ FPT-Algorithms for Computing Gromov-Hausdorff and Interleaving Distances Between Trees ⋮ Decorated merge trees for persistent topology

This page was built for publication: Computing the Gromov-Hausdorff Distance for Metric Trees