Computing Optimal Morse Matchings
From MaRDI portal
Publication:5470812
DOI10.1137/S0895480104445885zbMath1190.90162arXivmath/0408331WikidataQ117245099 ScholiaQ117245099MaRDI QIDQ5470812
Marc E. Pfetsch, Michael Joswig
Publication date: 1 June 2006
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0408331
General topology of complexes (57Q05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Extremal examples of collapsible complexes and random discrete Morse theory, Approximation algorithms for Max Morse matching, Notes on the Simplification of the Morse-Smale Complex, Courcelle's theorem for triangulations, Allowing cycles in discrete Morse theory, Morse theory for filtrations and efficient computation of persistent homology, An entropy-based persistence barcode, Generalised cone complexes and tropical moduli in polymake, Shellable tilings on relative simplicial complexes and their \(h\)-vectors, On discrete gradient vector fields and Laplacians of simplicial complexes, Discrete Morse theory for the moduli spaces of polygonal linkages, or solitaire on a circle, Collapsibility to a subcomplex of a given dimension is NP-complete, On the rooted forests in triangulated closed manifolds, Optimal topological simplification of discrete functions on surfaces, Random Discrete Morse Theory and a New Library of Triangulations, Discrete Morse theory for computing zigzag persistence, Recognition of collapsible complexes is NP-complete, SCIP: solving constraint integer programs, On the local homology of Artin groups of finite and affine type, Birth and death in discrete Morse theory, Reducing complexes in multidimensional persistent homology theory, Unnamed Item, Parameterized Complexity of Discrete Morse Theory, A graph-theoretical approach to cancelling critical elements, The number of critical elements of discrete Morse functions on non-compact surfaces, Discrete Morse theory for manifolds with boundary, Frontiers of sphere recognition in practice, Searching combinatorial optimality using graph-based homology information
