Parameterized complexity of perfectly matched sets (Q6038698)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7681299
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity of perfectly matched sets |
scientific article; zbMATH DE number 7681299 |
Statements
Parameterized complexity of perfectly matched sets (English)
0 references
2 May 2023
0 references
perfectly matched sets
0 references
parameterized complexity
0 references
apex-minor-free graphs
0 references
\(d\)-degenerate graphs
0 references
planar graphs
0 references
interval graphs
0 references
0.9291239
0 references
0 references
0.9017427
0 references
0.8947996
0 references
0.8947996
0 references
0 references
0.8902353
0 references
0.8898786
0 references
