Efficient algorithms for computing a minimal homology basis

DOI10.1007/978-3-319-77404-6_28zbMath1485.68320arXiv1801.06759OpenAlexW2962948267MaRDI QIDQ2294699

Yusu Wang, Tianqi Li, Tamal Krishna Dey

Publication date: 12 February 2020

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Relations of low-dimensional topology with graph theory (57M15) Simplicial sets and complexes in algebraic topology (55U10) Computational aspects of digital topology (68U03)

Related Items (5)

Persistent Homology: A Topological Tool for Higher-Interaction Systems ⋮ Canonical sphere bases for simplicial and cubical complexes ⋮ A heuristic for short homology basis of digital objects ⋮ Structure on the top homology and related algorithms ⋮ An efficient algorithm for 1-dimensional (Persistent) path homology

This page was built for publication: Efficient algorithms for computing a minimal homology basis