Computing Minimal Persistent Cycles: Polynomial and Hard Cases

DOI10.1137/1.9781611975994.158MaRDI QIDQ5146949zbMATH OpenOpenAlexFDO

Authors Tao Hou, Sayan Mandal, Tamal K. Dey

Publication date 2 February 2021

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

Full work available at URL https://arxiv.org/abs/1907.04889

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(7)

• Lexicographic optimal homologous chains and applications to point cloud triangulations
• Persistency in 0-1 polynomial programming
• Efficient computation of a semi-algebraic basis of the first homology group of a semi-algebraic set
• Delaunay-like triangulation of smooth orientable submanifolds by _1-norm minimization
• Lexicographic optimal chains and critical bases
• Computing zigzag persistence on graphs in near-linear time
• Tracking the persistence of harmonic chains: barcode and stability

This page was built for publication: Computing Minimal Persistent Cycles: Polynomial and Hard Cases

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