Parameterized complexity of induced graph matching on claw-free graphs (Q487013)
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 6387700
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity of induced graph matching on claw-free graphs |
scientific article; zbMATH DE number 6387700 |
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
0.965776026248932
0 references
0.8480239510536194
0 references
0.8462727069854736
0 references
0.8410945534706116
0 references
0.8288794159889221
0 references
