TADD: a computational framework for data analysis using discrete Morse theory
ICMS'10 Proceedings of the Third international congress conference on Mathematical software
Zigzag persistent homology in matrix multiplication time
Proceedings of the twenty-seventh annual symposium on Computational geometry
Perfect discrete Morse functions on 2-complexes
Pattern Recognition Letters
Extraction of Dominant Extremal Structures in Volumetric Data Using Separatrix Persistence
Computer Graphics Forum
Parameterized complexity of discrete morse theory
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
Morse matchings capture the essential structural information of discrete Morse functions. We show that computing optimal Morse matchings is \NP-hard and give an integer programming formulation for the problem. Then we present polyhedral results for the corresponding polytope and report on computational results.