Maximum Independent Set in Graphs of Average Degree at Most Three in ${\mathcal O}(1.08537^n)$ (Q3569091): 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/978-3-642-13562-0_34 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W176103388 / rank | |||
Normal rank | |||
Latest revision as of 22:54, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum Independent Set in Graphs of Average Degree at Most Three in ${\mathcal O}(1.08537^n)$ |
scientific article |
Statements
Maximum Independent Set in Graphs of Average Degree at Most Three in ${\mathcal O}(1.08537^n)$ (English)
0 references
17 June 2010
0 references
