4 citations · 5 across the 6 of their papers we have counts for
4 papers · 1 filter
Towards Computing Average Merge Tree Based on the Interleaving Distance
Elena Farahbakhsh Touli, Ingrid Hotz, Talha Bin Masood
The interleaving distance is a key tool for comparing merge trees, which provide topological summaries of scalar functions. In this work, we define an average merge tree for a pair…
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…
Relative Clustering Coefficient
Elena Farahbakhsh Touli, Oscar Lindberg
In this paper, we relatively extend the definition of global clustering coefficient to another clustering, which we call it relative clustering coefficient. The idea of this defini…
FPT-algorithms for computing Gromov-Hausdorff and interleaving distances between trees
Elena Farahbakhsh Touli, Yusu Wang
Gromov-Hausdorff (GH) distance is a natural way to measure the distortion between two metric spaces. However, there has been only limited algorithmic development to compute or appr…