The compressed annotation matrix: an efficient data structure for computing persistent cohomology (Q893322): Difference between revisions

From MaRDI portal
Merged Item from Q2849358
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Clear and Compress: Computing Persistent Homology in Chunks / rank
 
Normal rank
Property / cites work
 
Property / cites work: PHAT – Persistent Homology Algorithms Toolbox / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Annotating Simplices with a Homology Basis and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An output-sensitive algorithm for persistent homology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of persistence diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dualities in persistent (co)homology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Persistent cohomology and circular coordinates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Topological Persistence for Simplicial Maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3655278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological persistence and simplification / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Gudhi Library: Simplicial Complexes and Persistent Homology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zigzag persistent homology in matrix multiplication time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing persistent homology / rank
 
Normal rank

Latest revision as of 02:12, 11 July 2024

scientific article; zbMATH DE number 6208886
  • The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology
Language Label Description Also known as
English
The compressed annotation matrix: an efficient data structure for computing persistent cohomology
scientific article; zbMATH DE number 6208886
  • The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology

Statements

The compressed annotation matrix: an efficient data structure for computing persistent cohomology (English)
0 references
The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology (English)
0 references
0 references
0 references
0 references
19 November 2015
0 references
17 September 2013
0 references
persistent cohomology
0 references
annotation
0 references
data structure
0 references
simplicial complex
0 references
algorithm
0 references
implementation
0 references
0 references
0 references
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references