On the parameterized complexity of the acyclic matching problem (Q6038700): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 17:15, 25 April 2024
scientific article; zbMATH DE number 7681300
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
