A user-chosen look-ahead parameter turns the expensive stable deformation-based merge tree edit distance into a family of polynomial-time approximations.
Title resolution pending
1 Pith paper cite this work, alongside 765 external citations. Polarity classification is still indexing.
1
Pith paper citing it
765
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.CG 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics
A user-chosen look-ahead parameter turns the expensive stable deformation-based merge tree edit distance into a family of polynomial-time approximations.