Parameterized complexity of perfectly matched sets (Q6038698): Difference between revisions
From MaRDI portal
Created a new Item |
(No difference)
|
Revision as of 15:18, 25 April 2024
scientific article; zbMATH DE number 7681299
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
