Computing Optimal Morse Matchings

Marc E. Pfetsch; Michael Joswig

REVIEW

Computing Optimal Morse Matchings

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv math/0408331 v1 pith:72DNILSM submitted 2004-08-24 math.CO math.OC

Michael Joswig , Marc E. Pfetsch This is my paper · ORCID

classification math.COmath.OC

keywords morsematchingscomputingoptimalresultscapturecomputationalcorresponding

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

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.

Discussion (0). Continue with ORCID to comment.

Pith tools