Parameterized complexity of discrete Morse theory (Q2828168)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parameterized complexity of discrete Morse theory |
scientific article; zbMATH DE number 6405119
- Parameterized complexity of discrete morse theory
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized complexity of discrete Morse theory |
scientific article; zbMATH DE number 6405119 |
|
Statements
24 October 2016
0 references
17 February 2015
0 references
W[P]-completeness
0 references
alternating cycle-free matching
0 references
collapsibility
0 references
computational topology
0 references
discrete Morse theory
0 references
erasability
0 references
fixed-parameter tractability
0 references
parameterized complexity
0 references
treewidth
0 references
W[\(P\)]-completeness
0 references
fixed parameter tractability
0 references
0 references
1.0000002
0 references
0.91266114
0 references
0.89458114
0 references
0 references
0 references
0.8873117
0 references
0.8823845
0 references
0.88113666
0 references
Parameterized complexity of discrete Morse theory (English)
0 references
