Computing zigzag persistence on graphs in near-linear time

DOI10.4230/LIPICS.SOCG.2021.30MaRDI QIDQ7234087zbMATH OpenFDO

Authors Tamal K. Dey, Tao Hou

Publication date 27 April 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.SOCG.2021.30

zbMATH Keywords

dynamic networksgraph filtrationpersistent homologyzigzag persistence

Mathematics Subject Classification ID

Other homology theories in algebraic topology (55N35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• Alexander duality for functions: the persistent behavior of land and water and shore
• Computing height persistence and homology generators in \(\mathbb{R}^3\) efficiently
• Computing Minimal Persistent Cycles: Polynomial and Hard Cases
• Computing persistent homology
• Data structures for mergeable trees
• Extreme elevation on a 2-manifold
• scientific article; zbMATH DE number 7788370 (Why is no real title available?)
• Introduction to algorithms.
• Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
• Zigzag persistence
• Zigzag Persistence via Reflections and Transpositions
• Zigzag persistent homology and real-valued functions
• Zigzag persistent homology in matrix multiplication time

This page was built for publication: Computing zigzag persistence on graphs in near-linear time

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