Keeping it sparse: computing persistent homology revisited
From MaRDI portal
Recommendations
- Morse theory for filtrations and efficient computation of persistent homology
- Move schedules: fast persistence computations in coarse dynamic settings
- An output-sensitive algorithm for persistent homology
- Persistent Homology and Nested Dissection
- Ripser: efficient computation of Vietoris-Rips persistence barcodes
Cites work
- \textsc{Phat} -- persistent homology algorithms toolbox
- Barcodes of towers and a streaming algorithm for persistent homology
- Clear and compress: computing persistent homology in chunks
- Computational topology for data analysis
- Computational topology. An introduction
- Computing linking numbers of a filtration
- Computing persistent homology
- Distributed computation of persistent homology
- Dualities in persistent (co)homology
- Edge Collapse and Persistence of Flag Complexes
- Efficient computation of image persistence
- Efficient Computation of Persistent Homology for Cubical Data
- Efficient two-parameter persistence computation via cohomology
- Fast computation of persistent homology representatives with involuted persistent homology
- scientific article; zbMATH DE number 1253960 (Why is no real title available?)
- Reducibility among combinatorial problems
- Slice, simplify and stitch: topology-preserving simplification scheme for massive voxel data
- The hardness of approximate optima in lattices, codes, and systems of linear equations
- Tri-partitions and bases of an ordered complex
- Volume-optimal cycle: tightest representative cycle of a generator in persistent homology
- Zigzag persistent homology in matrix multiplication time
Cited in
(3)
This page was built for publication: Keeping it sparse: computing persistent homology revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6601459)
