Advice complexity of maximum independent set in sparse and bipartite graphs (Q2344218): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00224-014-9592-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2106260425 / rank | |||
Normal rank | |||
Revision as of 00:53, 20 March 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
