Computing Optimal Discrete Morse Functions

DOI10.1016/j.endm.2004.03.038zbMath1121.90423OpenAlexW1996377301WikidataQ117245105 ScholiaQ117245105MaRDI QIDQ3439152

Michael Joswig, Marc E. Pfetsch

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2004.03.038

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (2)

Critical sets in discrete Morse theories: relating Forman and piecewise-linear approaches ⋮ Parameterized Complexity of Discrete Morse Theory

Uses Software

• Simplicial complex library

Cites Work

• Morse theory for cell complexes
• A computationally intractable problem on simplicial complexes
• On discrete Morse functions and combinatorial decompositions
• On the acyclic subgraph polytope
• The group of projectivities and colouring of the facets of a simple polytope

This page was built for publication: Computing Optimal Discrete Morse Functions