📝 SummarXiv

Abstract

Merge trees are fundamental structures in topological data analysis. Interleaving distance is a widely accepted metric for comparing merge trees, with applications in visualization and scientific computing. While a greedy algorithm exists for finding the interleaving distance between labeled merge trees with overlapping labels, computing the interleaving distance between unlabeled trees or labeled trees with disjoint labels remains a significant challenge. In this work, we introduce a novel heuristic algorithm for approximating the interleaving distance between labeled merge trees with partial agreement and disagreement. Our method strategically assigns labels primarily to the leaves of the trees to infer structural correspondence. We also introduce an enhanced version of a previous algorithm that offers improved performance. Both algorithms run in polynomial time and provide practical, efficient alternatives for comparing merge trees, particularly in cases involving unlabeled or structurally diverse data. This work contributes a new direction for merge tree analysis and offers promising tools for real-world applications. We demonstrate this application on the simulation of time-varying electron density.