Maximum weight independent sets in hole- and dart-free graphs (Q714022)
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 6096018
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum weight independent sets in hole- and dart-free graphs |
scientific article; zbMATH DE number 6096018 |
Statements
Maximum weight independent sets in hole- and dart-free graphs (English)
0 references
19 October 2012
0 references
graph algorithms
0 references
maximum weight independent set problem
0 references
clique separators
0 references
hole-free graphs
0 references
dart-free greaphs
0 references
gem-free graphs
0 references
0 references
0 references
0 references
0.926383376121521
0 references
0.8931593894958496
0 references
0.877402663230896
0 references
0.8671557307243347
0 references
0.8566982746124268
0 references
