Computing Persistent Homology of Flag Complexes via Strong Collapses
From MaRDI portal
Publication:5088987
DOI10.4230/LIPIcs.SoCG.2019.55OpenAlexW2936641353MaRDI QIDQ5088987
Siddharth Pritam, Jean-Daniel Boissonnat
Publication date: 18 July 2022
Full work available at URL: https://hal.inria.fr/hal-02078311
Related Items (4)
Strong collapse and persistent homology ⋮ Collapsibility and homological properties of \(\mathfrak{I}\)-contractible transformations ⋮ The Persistent Homology of Cyclic Graphs ⋮ Minimal graphs for contractible and dismantlable properties
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Morse theory for filtrations and efficient computation of persistent homology
- Foldings in graphs and relations with simplicial complexes and posets
- Strong homotopy types, nerves and collapses
- Complexity of simplicial homology and independence complexes of chordal graphs
- Stability of persistence diagrams
- A Klein-bottle-based dictionary for texture representation
- On the local behavior of spaces of natural images
- Computing persistent homology
- Topological persistence and simplification
- Zigzag persistence
- Filtration simplification for persistent homology via edge contraction
- Approximating persistent homology in Euclidean space through collapses
- Linear-size approximations to the Vietoris-Rips filtration
- Building efficient and compact data structures for simplicial complexes
- Simplification of complexes for persistent homology computations
- Coverage in sensor networks via persistent homology
- Homology groups of relations
- Approximate Čech Complex in Low and High Dimensions
- PHAT – Persistent Homology Algorithms Toolbox
- Polynomial-Sized Topological Approximations Using The Permutahedron
- Powers of tensors and fast matrix multiplication
- Clear and Compress: Computing Persistent Homology in Chunks
- Towards persistence-based reconstruction in euclidean spaces
- An Efficient Representation for Filtrations of Simplicial Complexes
- Barcodes of Towers and a Streaming Algorithm for Persistent Homology
- SimBa: An Efficient Tool for Approximating Rips-filtration Persistence via Simplicial Batch-collapse
- Computing Topological Persistence for Simplicial Maps
- Strong Collapse for Persistence
- Topology of viral evolution
- Zigzag Persistence via Reflections and Transpositions
- Zigzag persistent homology and real-valued functions
- Zigzag persistent homology in matrix multiplication time
- The tidy set
- Simplicial Spaces, Nuclei and m -Groups
- Recognition of collapsible complexes is NP-complete
This page was built for publication: Computing Persistent Homology of Flag Complexes via Strong Collapses
