Pages that link to "Item:Q2828168"
From MaRDI portal
The following pages link to Parameterized complexity of discrete Morse theory (Q2828168):
Displaying 17 items.
- Courcelle's theorem for triangulations (Q346450) (← links)
- An entropy-based persistence barcode (Q1677071) (← links)
- Collapsibility to a subcomplex of a given dimension is NP-complete (Q1702356) (← links)
- Frontiers of sphere recognition in practice (Q2098099) (← links)
- Factor complexity and permutation complexity of the generalized Morse sequence (Q2318232) (← links)
- Approximation algorithms for Max Morse matching (Q2362103) (← links)
- Parameterized complexity of discrete Morse theory (Q2828168) (← links)
- Computing Optimal Discrete Morse Functions (Q3439152) (← links)
- Simplification of Morse Decompositions Using Morse Set Mergers (Q3454943) (← links)
- Tree-Based Encoding for Cancellations on Morse Complexes (Q3651625) (← links)
- Discrete Morse theory for the moduli spaces of polygonal linkages, or solitaire on a circle (Q4603917) (← links)
- (Q5075747) (← links)
- (Q5088974) (← links)
- (Q5115814) (← links)
- (Q5174470) (redirect page) (← links)
- Random Discrete Morse Theory and a New Library of Triangulations (Q5418075) (← links)
- On the pathwidth of hyperbolic 3-manifolds (Q5881542) (← links)