Frechet-Like Distances between Two Merge Trees

Elena Farahbakhsh Touli

Home/Archive/arXiv

arXiv · 2004.10747

Frechet-Like Distances between Two Merge Trees

Elena Farahbakhsh Touli

View original source ↗Read source document ↗Export metadata ↓

Abstract

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.

Explore related subjects

cs.CC cs.CG

Keep this discovery

BibTeX RIS

Elena Farahbakhsh Touli. 2020-04-22. Frechet-Like Distances between Two Merge Trees. https://arxiv.org/abs/2004.10747

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗

arXiv2026

Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor

We show that there is a fixed planar graph $H$, namely the $5 \times 5$ grid, such that Max Independent Set remains NP-hard in $H$-induced-minor-free graphs. This refutes the Dallard--Milani\v{c}--\v{S}torgel conjecture and a weakening of it by Gartland and Lokshtanov, and by Korhonen.

cs.CC↗

arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗