On the parameterized complexity of the acyclic matching problem (Q6038700): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4362673250 / rank | |||
Normal rank |
Revision as of 08:55, 30 July 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