Parameterized complexity of induced graph matching on claw-free graphs (Q487013): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:01, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized complexity of induced graph matching on claw-free graphs |
scientific article |
Statements
Parameterized complexity of induced graph matching on claw-free graphs (English)
0 references
19 January 2015
0 references
algorithms and data structures
0 references
induced matchings
0 references
claw-free graphs
0 references
fixed-parameter tractability
0 references
