Exact computation of the matching distance on 2-parameter persistence modules
From MaRDI portal
Recommendations
- Exact computation of the matching distance on 2-parameter persistence modules
- Exact computation of the matching distance on 2-parameter persistence modules
- Efficient Approximation of the Matching Distance for 2-Parameter Persistence
- On the geometrical properties of the coherent matching distance in 2D persistent homology
- Computing bottleneck distance for 2-D interval decomposable modules
Cites work
- Algorithms for Reporting and Counting Geometric Intersections
- Betti numbers in multidimensional persistent homology are stable functions
- Computational geometry. Algorithms and applications.
- Computational topology. An introduction
- Computing bottleneck distance for 2-D interval decomposable modules
- Computing persistent homology
- Computing the interleaving distance is NP-hard
- Decomposition of pointwise finite-dimensional persistence modules.
- Geometry helps in bottleneck matching and related problems
- Geometry helps to compare persistence diagrams
- Persistence theory. From quiver representations to data analysis
- The rank invariant stability via interleavings
- The representation theorem of persistence revisited and generalized
- The theory of multidimensional persistence
- The theory of the interleaving distance on multidimensional persistence modules
- Zigzag persistent homology in matrix multiplication time
Cited in
(11)- Generalized persistence algorithm for decomposing multiparameter persistence modules
- Compression for \(2\)-parameter persistent homology
- Computing the interleaving distance is NP-hard
- On the geometrical properties of the coherent matching distance in 2D persistent homology
- The reflection distance between zigzag persistence modules
- Efficient Approximation of the Matching Distance for 2-Parameter Persistence
- Geometry of the matching distance for 2D filtering functions
- Exact computation of the matching distance on 2-parameter persistence modules
- Interleaving by parts: join decompositions of interleavings and join-assemblage of geodesics
- The shift-dimension of multipersistence modules
- Matching distance via the extended Pareto grid
This page was built for publication: Exact computation of the matching distance on 2-parameter persistence modules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088978)
