Realizable piecewise linear paths of persistence diagrams with Reeb graphs
From MaRDI portal
Publication:6601458
Cites work
- scientific article; zbMATH DE number 5506200 (Why is no real title available?)
- scientific article; zbMATH DE number 1461253 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 3106699 (Why is no real title available?)
- A deterministic \(O(m \log m)\) time algorithm for the Reeb graph
- A randomized O ( m log m ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
- Categorified Reeb graphs
- Computing persistent homology
- Decorated merge trees for persistent topology
- Efficient algorithms for computing Reeb graphs
- Extending persistence using Poincaré and Lefschetz duality
- Extracting Persistent Clusters in Dynamic Data via M\"obius inversion
- Extreme elevation on a 2-manifold
- Inverse problems in topological persistence
- Local equivalence and intrinsic metrics between Reeb graphs
- Loops in Reeb graphs of 2-manifolds
- Measuring distance between Reeb graphs (extended abstract)
- Persistence theory. From quiver representations to data analysis
- Reeb graphs for shape analysis and applications
- Stability of persistence diagrams
- Strong equivalence of the interleaving and functional distortion metrics for Reeb graphs
- Structure and stability of the one-dimensional Mapper
- The Reeb graph edit distance is universal
- The edit distance for Reeb graphs of surfaces
- Theory of interleavings on categories with a flow
This page was built for publication: Realizable piecewise linear paths of persistence diagrams with Reeb graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6601458)
