Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs (Q2817880)
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: Maximum Weight Independent Sets in ( S_{1,1,3} , bull)-free Graphs |
scientific article; zbMATH DE number 6622045
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs |
scientific article; zbMATH DE number 6622045 |
Statements
Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs (English)
0 references
2 September 2016
0 references
graph algorithms
0 references
weighted independent set
0 references
modular decomposition
0 references
claw-free graph
0 references
fork-free graph
0 references
bull-free graph
0 references
0 references
0 references
0 references
0.93440187
0 references
0.91711307
0 references
0.9148361
0 references
0.90654117
0 references
0.90465677
0 references
0.89467734
0 references
0.8938343
0 references
0.89000374
0 references
0 references
