An O(m²n)-time algorithm is given for computing compatible representative cycles along bars in zigzag filtrations of simplicial complexes.
Persistence Theory: From Quiver Representations to Data Analysis , volume 209
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Fast Algorithm for Computing Zigzag Representatives
An O(m²n)-time algorithm is given for computing compatible representative cycles along bars in zigzag filtrations of simplicial complexes.