Presents ILP formulations to bound the interleaving distance on mapper graphs, with evaluation on small examples and benchmark datasets.
A graph-matching formulation of the interleaving distance between merge trees, 2024
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Towards an Optimal Bound for the Interleaving Distance on Mapper Graphs
Presents ILP formulations to bound the interleaving distance on mapper graphs, with evaluation on small examples and benchmark datasets.