The Reeb graph edit distance is universal
From MaRDI portal
Publication:2052722
DOI10.1007/s10208-020-09488-3zbMath1485.55006arXiv1801.01866OpenAlexW3037363393MaRDI QIDQ2052722
Facundo Mémoli, Ulrich Bauer, Landi, Claudia
Publication date: 26 November 2021
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.01866
Persistent homology and applications, topological data analysis (55N31) Metric spaces, metrizability (54E35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items
Universality of persistence diagrams and the bottleneck and Wasserstein distances ⋮ Edit Distance and Persistence Diagrams over Lattices ⋮ Distances and isomorphism between networks: stability and convergence of network invariants ⋮ FPT-Algorithms for Computing Gromov-Hausdorff and Interleaving Distances Between Trees ⋮ Generalized persistence diagrams for persistence modules over posets
Cites Work
- Unnamed Item
- Unnamed Item
- The edit distance for Reeb graphs of surfaces
- Categorified Reeb graphs
- On intrinsic geometry of surfaces in normed spaces
- Stability of persistence diagrams
- Natural pseudo-distance and optimal matching between reduced size functions
- The natural pseudo-distance as a quotient pseudo-metric, and applications
- The theory of the interleaving distance on multidimensional persistence modules
- Parametrized complexity theory.
- Reeb graphs of curves are stable under function perturbations
- Distances Between Datasets
- Measuring Distance between Reeb Graphs
- Natural pseudodistances between closed manifolds
- FPT-Algorithms for Computing Gromov-Hausdorff and Interleaving Distances Between Trees
- Nilpotent types and fracture squares in homotopy type theory
- Strong Equivalence of the Interleaving and Functional Distortion Metrics for Reeb Graphs