Advice complexity of maximum independent set in sparse and bipartite graphs (Q2344218): Difference between revisions
From MaRDI portal
Latest revision as of 02:30, 10 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Advice complexity of maximum independent set in sparse and bipartite graphs |
scientific article |
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