Computing Optimal Morse Matchings
classification
🧮 math.CO
math.OC
keywords
morsematchingscomputingoptimalresultscapturecomputationalcorresponding
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.