Computing Minimal Persistent Cycles: Polynomial and Hard Cases

DOI10.1137/1.9781611975994.158OpenAlexW3002301362MaRDI QIDQ5146949

Tao Hou, Sayan Mandal, Tamal Krishna 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)

Related Items (1)

Lexicographic optimal homologous chains and applications to point cloud triangulations

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