Computing maximum independent set on outerstring graphs and their relatives (Q5918655)
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: Computing maximum independent set on outerstring graphs and their relatives |
scientific article; zbMATH DE number 7505558
| 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 7505558 |
Statements
Computing maximum independent set on outerstring graphs and their relatives (English)
0 references
8 April 2022
0 references
maximum independent set problem
0 references
outerstring graphs
0 references
fine-grained complexity
0 references
circle graphs
0 references
0 references
0.9999999
0 references
0.9357505
0 references
0.9179568
0 references
0.9125891
0 references
0.9090547
0 references
0.9086778
0 references
0.90836966
0 references
