53 citations · 219 across the 20 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.CG2023
Computing Zigzag Vineyard Efficiently Including Expansions and Contractions
Tamal K. Dey, Tao Hou
Vines and vineyard connecting a stack of persistence diagrams have been introduced in the non-zigzag setting by Cohen-Steiner et al. We consider computing these vines over changing…
cs.CG2023
Revisiting Graph Persistence for Updates and Efficiency
Tamal K. Dey, Tao Hou, Salman Parsa
It is well known that ordinary persistence on graphs can be computed more efficiently than the general persistence. Recently, it has been shown that zigzag persistence on graphs al…