A fast algorithm for computing zigzag representatives

DOI10.1007/S00453-026-01386-4MaRDI QIDQ7239684zbMATH OpenFDO

Authors Tamal K. Dey, Tao Hou, Dmitriy Morozov

Publication date 8 May 2026

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00453-026-01386-4

zbMATH Keywords

persistent homologytopological data analysiszigzag persistencerepresentatives

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites work

• scientific article; zbMATH DE number 5506200 (Why is no real title available?)
• Computational topology for data analysis
• Computational topology. An introduction
• Computing zigzag vineyard efficiently including expansions and contractions
• Discrete Morse theory for computing zigzag persistence
• Fast computation of zigzag persistence
• Persistence theory. From quiver representations to data analysis
• Revisiting graph persistence for updates and efficiency
• Unzerlegbare Darstellungen. I. (Indecomposable representations. I)
• Zigzag Persistence via Reflections and Transpositions
• Zigzag persistence
• Zigzag persistent homology and real-valued functions
• Zigzag persistent homology in matrix multiplication time

This page was built for publication: A fast algorithm for computing zigzag representatives

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