1 citations · 1 across the 5 of their papers we have counts for
6 papers
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…
Monitoring the Dynamic Networks of Stock Returns
Elena Farahbakhsh Touli, Hoang Nguyen, Olha Bodnar
In this paper, we study the connection between the companies in the Swedish capital market. We consider 28 companies included in the determination of the market index OMX30. The ne…
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…
Frechet-Like Distances between Two Merge Trees
Elena Farahbakhsh Touli
The purpose of this paper is to extend the definition of Frechet distance which measures the distance between two curves to a distance (Frechet-Like distance) which measures the si…
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…