Computing persistent homology of flag complexes via strong collapses
From MaRDI portal
Recommendations
- Strong collapse and persistent homology
- Barcodes of towers and a streaming algorithm for persistent homology
- Simplification of complexes for persistent homology computations
- Barcodes of towers and a streaming algorithm for persistent homology
- Approximating persistent homology in Euclidean space through collapses
Cites work
- A Klein-bottle-based dictionary for texture representation
- An efficient representation for filtrations of simplicial complexes
- Approximate Čech Complex in Low and High Dimensions
- Approximating persistent homology in Euclidean space through collapses
- Barcodes of towers and a streaming algorithm for persistent homology
- Building efficient and compact data structures for simplicial complexes
- Clear and compress: computing persistent homology in chunks
- Complexity of simplicial homology and independence complexes of chordal graphs
- Computational topology. An introduction
- Computing persistent homology
- Computing topological persistence for simplicial maps (extended abstract)
- Coverage in sensor networks via persistent homology
- Foldings in graphs and relations with simplicial complexes and posets
- Homology groups of relations
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- Morse theory for filtrations and efficient computation of persistent homology
- On the local behavior of spaces of natural images
- PHAT -- persistent homology algorithms toolbox
- Polynomial-sized topological approximations using the permutahedron
- Powers of tensors and fast matrix multiplication
- Quiver representations.
- Recognition of collapsible complexes is NP-complete
- SimBa: an efficient tool for approximating Rips-filtration persistence via simplicial batch-collapse
- Simplicial Spaces, Nuclei and m -Groups
- Simplification of complexes for persistent homology computations
- Stability of persistence diagrams
- Strong Collapse for Persistence
- Strong homotopy types, nerves and collapses
- The tidy set, a minimal simplicial set for computing homology of clique complexes
- Topological persistence and simplification
- Topology of viral evolution
- Towards persistence-based reconstruction in euclidean spaces
- Zigzag persistence
- Zigzag Persistence via Reflections and Transpositions
- Zigzag persistent homology and real-valued functions
- Zigzag persistent homology in matrix multiplication time
Cited in
(7)- Collapsibility and homological properties of \(\mathfrak{I}\)-contractible transformations
- Strong Collapse for Persistence
- The Persistent Homology of Cyclic Graphs
- Strong collapse and persistent homology
- Minimal graphs for contractible and dismantlable properties
- Stratified simple homotopy type: theory and computation
- On edge collapse of random simplicial complexes
This page was built for publication: Computing persistent homology of flag complexes via strong collapses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088987)
