An Efficient Representation for Filtrations of Simplicial Complexes

DOI10.1137/1.9781611974782.179zbMath1410.68095OpenAlexW2888620915MaRDI QIDQ4575929

C. S. Karthik, Jean-Daniel Boissonnat

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974782.179

Mathematics Subject Classification ID

General topology of complexes (57Q05) Data structures (68P05)

Related Items (2)

Strong Collapse for Persistence ⋮ Computing Persistent Homology of Flag Complexes via Strong Collapses

This page was built for publication: An Efficient Representation for Filtrations of Simplicial Complexes