Algorithmic construction of acyclic partial matchings for multidimensional persistence

DOI10.1007/978-3-319-66272-5_30zbMath1431.55016OpenAlexW2750288705MaRDI QIDQ1690425

Madjid Allili, Filippo Masoni, Tomasz Kaczynski, Landi, Claudia

Publication date: 19 January 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-66272-5_30

zbMATH Keywords

matching algorithmdiscrete Morse theorymultidimensional persistent homologyacyclic partial matchingsreduced complex

Mathematics Subject Classification ID

Simplicial sets and complexes in algebraic topology (55U10) Other homology theories in algebraic topology (55N35) Combinatorial aspects of simplicial complexes (05E45)

Related Items (3)

Computing multiparameter persistent homology through a discrete Morse-based approach ⋮ Acyclic partial matchings for multidimensional persistence: algorithm and combinatorial interpretation ⋮ Relative-perfectness of discrete gradient vector fields and multi-parameter persistent homology

This page was built for publication: Algorithmic construction of acyclic partial matchings for multidimensional persistence