Labeled interleaving distance for Reeb graphs
From MaRDI portal
Publication:6669855
Recommendations
Cites work
- 3D shape retrieval using kernels on extended Reeb graphs
- A CONTOUR TREE BASED VISUALIZATION FOR EXPLORING DATA WITH UNCERTAINTY
- A course in metric geometry
- A deterministic \(O(m \log {m})\) time algorithm for the Reeb graph
- Categorified Reeb graphs
- Computational complexity of the interleaving distance
- Computational topology. An introduction
- Computing the interleaving distance is NP-hard
- Extending persistence using Poincaré and Lefschetz duality
- FPT-algorithms for computing Gromov-Hausdorff and interleaving distances between trees
- Fast similarity search in scalar fields using merging histograms
- Local equivalence and intrinsic metrics between Reeb graphs
- Measuring the distance between merge trees
- On high-dimensional representations of knot groups
- On the stability of interval decomposable persistence modules
- Proximity of persistence modules and their diagrams
- Reeb graphs: approximation and persistence
- Strong equivalence of the interleaving and functional distortion metrics for Reeb graphs
- The JS-graphs of join and split trees (extended abstract)
- The Reeb graph edit distance is universal
- The \(\ell^\infty\)-cophenetic metric for phylogenetic trees as an interleaving distance
- The edit distance for Reeb graphs of surfaces
- Tight quasi-universality of Reeb graph distances
- Time-varying Reeb graphs for continuous space-time data
This page was built for publication: Labeled interleaving distance for Reeb graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6669855)