Computing Optimal Morse Matchings

Simple item page
dc.creatorJoswig, Michael
dc.creatorPfetsch, Marc E.
dc.date2004-08-24
dc.date.accessioned2026-07-07T05:11:31Z
dc.date.available2026-07-07T05:11:31Z
dc.descriptionMorse 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.
dc.identifierhttps://arxiv.org/abs/math/0408331
dc.identifierhttp://arxiv.org/abs/math/0408331
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/72270
dc.subjectCombinatorics
dc.subjectOptimization and Control
dc.subject90C27 (06A07, 52B99, 57Q05, 57R70)
dc.titleComputing Optimal Morse Matchings
dc.typetext

Files

Collections

arXiv