Frechet-Like Distances between Two Merge Trees

04/22/2020
by   Elena Farahbakhsh Touli, et al.
0

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 similarity between two rooted trees. The definition of Frechet-Like distance is as follows: Tow men start from the roots of two trees. When they reach to a node with the degree of more than 2, they construct k-1 men which k is the outgoing degree of the node and each man monitor a man in another tree (there is a rope between them). The distance is the minimum length of the ropes between the men and the men whom are monitored and they all go forward (the geodesic distance between them to the root of the tree increases) and reach to the leaves of the trees. Here, I prove that the Frechet-Like distance between two trees is SNP-hard to compute. I modify the definition of Frechet-Like distance to measure the distance between tow merge trees, and I prove the relation between the interleaving distance and the modified Frechet-Like distance.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/22/2021

The Universal ℓ^p-Metric on Merge Trees

Adapting a definition given by Bjerkevik and Lesnick for multiparameter ...
research
12/01/2021

Quasi-universality of Reeb graph distances

We establish bi-Lipschitz bounds certifying quasi-universality (universa...
research
12/27/2021

How to choose the root: centrality measures over tree structures

Centrality measures are commonly used to analyze graph-structured data; ...
research
11/06/2018

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

Gromov-Hausdorff (GH) distance is a natural way to measure the distortio...
research
09/24/2009

Rumors in a Network: Who's the Culprit?

We provide a systematic study of the problem of finding the source of a ...
research
10/16/2022

Computing a Stable Distance on Merge Trees

Distances on merge trees facilitate visual comparison of collections of ...
research
10/18/2022

Comparing Embedded Graphs Using Average Branching Distance

Graphs drawn in the plane are ubiquitous, arising from data sets through...

Please sign up or login with your details

Forgot password? Click here to reset