Fast Minimal Presentations of Bi-graded Persistence Modules

DOI10.1137/1.9781611976472.16OpenAlexW3141985190MaRDI QIDQ5147543

No author found.

Publication date: 27 January 2021

Published in: 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.15623

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (5)

What Are Higher-Order Networks? ⋮ Computing the multicover bifiltration ⋮ On the Stability of Multigraded Betti Numbers and Hilbert Functions ⋮ Compression for \(2\)-parameter persistent homology ⋮ Computing Minimal Presentations and Bigraded Betti Numbers of 2-Parameter Persistent Homology

This page was built for publication: Fast Minimal Presentations of Bi-graded Persistence Modules