Realizable piecewise linear paths of persistence diagrams with Reeb graphs
From MaRDI portal
Publication:6601458
DOI10.57717/CGT.V3I1.38MaRDI QIDQ6601458FDOQ6601458
Authors: Rehab Alharbi, Erin W. Chambers, Elizabeth Munch 
Publication date: 10 September 2024
Published in: CGT. Computing in Geometry and Topology (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Stability of persistence diagrams
- Title not available (Why is that?)
- Computing persistent homology
- The edit distance for Reeb graphs of surfaces
- Title not available (Why is that?)
- Measuring distance between Reeb graphs (extended abstract)
- Strong equivalence of the interleaving and functional distortion metrics for Reeb graphs
- Title not available (Why is that?)
- Efficient algorithms for computing Reeb graphs
- Extending persistence using Poincaré and Lefschetz duality
- Reeb graphs for shape analysis and applications
- A deterministic \(O(m \log m)\) time algorithm for the Reeb graph
- Categorified Reeb graphs
- Loops in Reeb graphs of 2-manifolds
- A randomized O ( m log m ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
- Extreme elevation on a 2-manifold
- Theory of interleavings on categories with a flow
- Structure and stability of the one-dimensional Mapper
- Local equivalence and intrinsic metrics between Reeb graphs
- The Reeb graph edit distance is universal
- Persistence theory. From quiver representations to data analysis
- Decorated merge trees for persistent topology
- Inverse problems in topological persistence
- Extracting Persistent Clusters in Dynamic Data via M\"obius inversion
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)
