activity
20182026
most citedFPT-algorithms for computing Gromov-Hausdorff and interleaving distances between trees

4 citations · 5 across the 6 of their papers we have counts for

collaborators
Showing 2025Show all

1 paper · 1 filter

cs.CG2025

Efficient Heuristic Algorithms for Interleaving Distance between Merge Trees

Elena Farahbakhsh Touli, Talha Bin Masood

Merge trees are fundamental structures in topological data analysis. Interleaving distance is a widely accepted metric for comparing merge trees, with applications in visualization…