12 citations · 21 across the 6 of their papers we have counts for
3 papers · 1 filter
A New Matching Algorithm for Multidimensional Persistence
Madjid Allili, Tomasz Kaczynski, Claudia Landi +1
An algorithm is presented that constructs an acyclic partial matching on the cells of a given simplicial complex from a vector-valued function defined on the vertices and extended…
Reducing complexes in multidimensional persistent homology theory
Madjid Allili, Tomasz Kaczynski, Claudia Landi
The Discrete Morse Theory of Forman appeared to be useful for providing filtration-preserving reductions of complexes in the study of persistent homology. So far, the algorithms co…
Comparison of Persistent Homologies for Vector Functions: from continuous to discrete and back
Niccolò Cavazza, Marc Ethier, Patrizio Frosini +2
The theory of multidimensional persistent homology was initially developed in the discrete setting, and involved the study of simplicial complexes filtered through an ordering of t…