Computing maximum independent set on outerstring graphs and their relatives (Q5919310)
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 7152211
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing maximum independent set on outerstring graphs and their relatives |
scientific article; zbMATH DE number 7152211 |
Statements
Computing maximum independent set on outerstring graphs and their relatives (English)
0 references
16 January 2020
0 references
0.9934452772140504
0 references
0.845330536365509
0 references
0.8439638018608093
0 references
0.7830492854118347
0 references
0.7506392002105713
0 references
