The following pages link to Computing Optimal Morse Matchings (Q5470812):
Displaying 33 items.
- Courcelle's theorem for triangulations (Q346450) (← links)
- Morse theory for filtrations and efficient computation of persistent homology (Q368767) (← links)
- Optimal topological simplification of discrete functions on surfaces (Q664359) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- Birth and death in discrete Morse theory (Q739613) (← links)
- Reducing complexes in multidimensional persistent homology theory (Q739614) (← links)
- The number of critical elements of discrete Morse functions on non-compact surfaces (Q1041649) (← links)
- An entropy-based persistence barcode (Q1677071) (← links)
- Collapsibility to a subcomplex of a given dimension is NP-complete (Q1702356) (← links)
- Morse matchings on polytopes (Q1938752) (← links)
- Frontiers of sphere recognition in practice (Q2098099) (← links)
- On the local homology of Artin groups of finite and affine type (Q2292412) (← links)
- Searching combinatorial optimality using graph-based homology information (Q2352515) (← links)
- Extremal examples of collapsible complexes and random discrete Morse theory (Q2358820) (← links)
- Approximation algorithms for Max Morse matching (Q2362103) (← links)
- Allowing cycles in discrete Morse theory (Q2401549) (← links)
- Parameterized complexity of discrete Morse theory (Q2828168) (← links)
- A graph-theoretical approach to cancelling critical elements (Q2840724) (← links)
- Discrete Morse theory for manifolds with boundary (Q2844853) (← links)
- Computing Optimal Discrete Morse Functions (Q3439152) (← links)
- Notes on the Simplification of the Morse-Smale Complex (Q3454951) (← links)
- Discrete Morse theory for the moduli spaces of polygonal linkages, or solitaire on a circle (Q4603917) (← links)
- Shellability is NP-complete (Q5115809) (← links)
- On the rooted forests in triangulated closed manifolds (Q5132624) (← links)
- Random Discrete Morse Theory and a New Library of Triangulations (Q5418075) (← links)
- Recognition of collapsible complexes is NP-complete (Q5964219) (← links)
- Generalised cone complexes and tropical moduli in polymake (Q6060356) (← links)
- Discrete Morse theory for computing zigzag persistence (Q6151036) (← links)
- Shellable tilings on relative simplicial complexes and their \(h\)-vectors (Q6168278) (← links)
- On discrete gradient vector fields and Laplacians of simplicial complexes (Q6192066) (← links)
- From finite vector field data to combinatorial dynamical systems in the sense of Forman (Q6645904) (← links)
- Multivariate central limit theorems for random clique complexes (Q6650245) (← links)
- Morse theoretic signal compression and reconstruction on chain complexes (Q6669851) (← links)
