Advice complexity of maximum independent set in sparse and bipartite graphs (Q2344218)
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 6435525
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Advice complexity of maximum independent set in sparse and bipartite graphs |
scientific article; zbMATH DE number 6435525 |
Statements
Advice complexity of maximum independent set in sparse and bipartite graphs (English)
0 references
12 May 2015
0 references
online algorithms
0 references
advice complexity
0 references
maximum independent set
0 references
0 references
0 references
0.8930537
0 references
0.8868396
0 references
0 references
0.8854704
0 references
0.88544387
0 references
0 references
