Computing bottleneck distance for 2-D interval decomposable modules
From MaRDI portal
Publication:5115800
Recommendations
- Computing the interleaving distance is NP-hard
- Computational complexity of the interleaving distance
- Topological spaces of persistence modules and their properties
- Exact computation of the matching distance on 2-parameter persistence modules
- The theory of the interleaving distance on multidimensional persistence modules
Cites work
- A new approximation algorithm for the matching distance in multidimensional persistence
- Algebraic stability of zigzag persistence modules
- Betti numbers in multidimensional persistent homology are stable functions
- Categorification of persistent homology
- Categorified Reeb graphs
- Computational complexity of the interleaving distance
- Computational topology. An introduction
- Computing Decompositions of Modules over Finite-Dimensional Algebras
- Computing bottleneck distance for 2-D interval decomposable modules
- Decomposition of Graded Modules
- Decomposition of exact pfd persistence bimodules
- Decomposition of pointwise finite-dimensional persistence modules.
- Generalized persistence diagrams
- Geometry helps to compare persistence diagrams
- Induced matchings of barcodes and the algebraic stability of persistence
- On the Krull-Schmidt theorem with application to sheaves
- On the stability of interval decomposable persistence modules
- Persistence theory. From quiver representations to data analysis
- Proximity of persistence modules and their diagrams
- Stability of persistence diagrams
- The rank invariant stability via interleavings
- The structure and stability of persistence modules
- The theory of multidimensional persistence
- The theory of the interleaving distance on multidimensional persistence modules
Cited in
(24)- Relative interleavings and applications to sensor networks
- Relative Koszul coresolutions and relative Betti numbers
- Spatiotemporal persistent homology for dynamic metric spaces
- Exact structures for persistence modules
- The theory of the interleaving distance on multidimensional persistence modules
- Computational complexity of the interleaving distance
- Computing bottleneck distance for 2-D interval decomposable modules
- Capturing dynamics of time-varying data via topology
- scientific article; zbMATH DE number 7559246 (Why is no real title available?)
- Computing the interleaving distance is NP-hard
- Computing invariants for multipersistence via spectral systems and effective homology
- Exact computation of the matching distance on 2-parameter persistence modules
- Interleaving distances, monoidal actions and 2-categories
- Bigraded Betti numbers and generalized persistence diagrams
- On the stability of interval decomposable persistence modules
- Probabilistic analysis of multiparameter persistence decompositions into intervals
- On the geometrical properties of the coherent matching distance in 2D persistent homology
- Elder-rule-staircodes for augmented metric spaces
- Computing minimal presentations and bigraded Betti numbers of 2-parameter persistent homology
- Generalized persistence algorithm for decomposing multiparameter persistence modules
- On approximation of 2D persistence modules by interval-decomposables
- On interval decomposability of 2D persistence modules
- Every 1D persistence module is a restriction of some indecomposable 2D persistence module
- Compression for \(2\)-parameter persistent homology
This page was built for publication: Computing bottleneck distance for 2-D interval decomposable modules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5115800)
