Algorithmic construction of acyclic partial matchings for multidimensional persistence

DOI10.1007/978-3-319-66272-5_30MaRDI QIDQ1690425zbMATH OpenOpenAlexFDO

Authors Madjid Allili, Tomasz Kaczynski, Filippo Masoni, C. Landi

Publication date 19 January 2018

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

zbMATH Keywords

discrete Morse theorymultidimensional persistent homologyacyclic partial matchingsmatching algorithmreduced complex

Mathematics Subject Classification ID

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

Recommendations

• Acyclic partial matchings for multidimensional persistence: algorithm and combinatorial interpretation
• Reducing complexes in multidimensional persistent homology theory
• MORSE REDUCTION FOR ZIGZAG COMPLEXES
• Persistent homology over directed acyclic graphs
• Computing persistent homology

Cited in

(5)

• Acyclic partial matchings for multidimensional persistence: algorithm and combinatorial interpretation
• MORSE REDUCTION FOR ZIGZAG COMPLEXES
• Computing multiparameter persistent homology through a discrete Morse-based approach
• Relative-perfectness of discrete gradient vector fields and multi-parameter persistent homology
• Partial matchings induced by morphisms between persistence modules

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1690425)