Computing Optimal Discrete Morse Functions

DOI10.1016/J.ENDM.2004.03.038zbMATH Open1121.90423OpenAlexW1996377301WikidataQ117245105 ScholiaQ117245105MaRDI QIDQ3439152FDOQ3439152

Authors: 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

Recommendations

• On optimizing discrete Morse functions
• Toward Optimality in Discrete Morse Theory
• Computing Optimal Morse Matchings
• Optimal discrete Morse functions for 2-manifolds
• Characterizing equivalent discrete Morse functions
• Polyhedral representation of discrete Morse functions
• Efficient computation of Lyapunov functions for Morse decompositions
• A note on optimization with Morse polynomials

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

• Allowing cycles in discrete Morse theory
• A combinatorial method to compute explicit homology cycles using discrete Morse theory
• Computational Discrete Morse Theory for Divergence-Free 2D Vector Fields
• Computing Optimal Morse Matchings
• Optimal discrete Morse functions for 2-manifolds
• Critical sets in discrete Morse theories: relating Forman and piecewise-linear approaches
• Searching combinatorial optimality using graph-based homology information
• Hardness of approximation for Morse matching

Uses Software

• Simplicial complex library

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439152)