Computing the Gromov-Hausdorff Distance for Metric Trees

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

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

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 spaces; embeddings

Mathematics Subject Classification ID

05C05: Trees

68R10: Graph theory (including graph drawing) in computer science

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

05C12: Distance in graphs

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68W25: Approximation algorithms