Computing a connection matrix and persistence efficiently from a Morse decomposition
From MaRDI portal
Cites work
- A computational framework for connection matrix theory
- Clear and compress: computing persistent homology in chunks
- Computational topology for data analysis
- Computational topology. An introduction
- Computing Connection Matrices via Persistence-Like Reductions
- Conley-Morse-Forman theory for combinatorial multivector fields on Lefschetz complexes
- Conley-Morse-Forman theory for generalized combinatorial multivector fields on finite topological spaces
- Connection matrices in combinatorial topological dynamics
- Efficient Computation of Persistent Homology for Cubical Data
- scientific article; zbMATH DE number 3616736 (Why is no real title available?)
- Index Filtrations and the Homology Index Braid for Partially Ordered Morse Decompositions
- Lyapunov maps, simplicial complexes and the Stone functor
- Morse theory for cell complexes
- Morse theory. Smooth and discrete
- Persistent homology of Morse decompositions in combinatorial dynamics
- Stability of persistence diagrams
- The Connection Matrix Theory for Morse Decompositions
This page was built for publication: Computing a connection matrix and persistence efficiently from a Morse decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6870542)
