Comparative analysis of scalar fields in scientific visualization often involves distance
functions on topological abstractions. This paper focuses on the merge tree abstraction …

In this paper we face the problem of representation of functional data with the tools of
algebraic topology. We represent functions by means of merge trees and this representation …

In this work we define a novel edit distance for graphs considered with some weights on the
edges. The metric is driven by the idea of considering graphs as topological summaries in …

In this work we define a metric structure for functions defined on merge trees. The metric
introduced possesses some stability properties and can be computed with a dynamical …

In this work we study the interleaving distance between merge trees from a combinatorial
point of view. We use a particular type of matching between trees to obtain a novel …

The well-studied Tai mapping between two rooted labeled trees T 1=(V 1, E 1) and T 2=(V 2,
E 2) defines a one-to-one mapping between nodes in T 1 and T 2 that preserves ancestor …

In this article, we propose tree edit distance with variables, which is an extension of the tree
edit distance to handle trees with variables and has a potential application to measuring the …

Dealing with complex data often presents challenges that can be successfully tackled with
the use of some geometrical tools. In this thesis we approach two such challenges …

In this paper, we propose Integer Linear Programming (ILP) formulations for computing the
tree alignment distance between unordered trees. Our formulation exploits a known …