TY - GEN A1 - Joswig, Michael A1 - Pfetsch, Marc T1 - Computing Optimal Morse Matchings N2 - 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. T3 - ZIB-Report - 04-37 KW - discrete Morse function KW - Morse matching Y1 - 2004 UR - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/812 UR - https://nbn-resolving.org/urn:nbn:de:0297-zib-8120 ER -