FPT-algorithms for computing Gromov-Hausdorff and interleaving distances between trees

DOI10.20382/JOCG.V13I1A4MaRDI QIDQ5077655zbMATH OpenFDO

Authors Elena Farahbakhsh Touli, Yusu Wang

Publication date 18 May 2022

Full work available at URL https://doi.org/10.20382/JOCG.V13I1A4

zbMATH Keywords

fixed-parameter tractable algorithmGromov-Hausdorff distancemetric trees

Mathematics Subject Classification ID

Metric spaces, metrizability (54E35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• FPT-algorithms for computing Gromov-Hausdorff and interleaving distances between trees
• Determining the Hausdorff distance between trees in polynomial time
• Computational aspects of the Gromov-Hausdorff distance and its application in non-rigid shape matching

Cited in

(4)

• The \(\ell^\infty\)-cophenetic metric for phylogenetic trees as an interleaving distance
• 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

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 Q5077655)