Computing Optimal Morse Matchings
Combinatorics
2007-05-23 v1 Optimization and Control
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.
Cite
@article{arxiv.math/0408331,
title = {Computing Optimal Morse Matchings},
author = {Michael Joswig and Marc E. Pfetsch},
journal= {arXiv preprint arXiv:math/0408331},
year = {2007}
}