Max weight independent set in graphs with no long claws: an analog of the Gyárfás' path argument (Q6560891)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Max weight independent set in graphs with no long claws: an analog of the Gyárfás' path argument |
scientific article; zbMATH DE number 7870303
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Max weight independent set in graphs with no long claws: an analog of the Gyárfás' path argument |
scientific article; zbMATH DE number 7870303 |
Statements
Max weight independent set in graphs with no long claws: an analog of the Gyárfás' path argument (English)
0 references
24 June 2024
0 references
max independent set
0 references
subdivided claw
0 references
QPTAS
0 references
subexponential-time algorithm
0 references
0.8158614635467529
0 references
0.8098340630531311
0 references
0.7987375259399414
0 references
0.795258104801178
0 references
