On the parameterized complexity of the acyclic matching problem (Q6038700)
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: On the parameterized complexity of the acyclic matching problem |
scientific article; zbMATH DE number 7681300
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the parameterized complexity of the acyclic matching problem |
scientific article; zbMATH DE number 7681300 |
Statements
On the parameterized complexity of the acyclic matching problem (English)
0 references
2 May 2023
0 references
acyclic matching
0 references
induced matching
0 references
computational complexity
0 references
parameterized complexity
0 references
treewidth
0 references
modular-width
0 references
0 references
