Finding a maximum induced degenerate subgraph faster than \(2^{n}\) (Q4899236)
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 6122691
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding a maximum induced degenerate subgraph faster than \(2^{n}\) |
scientific article; zbMATH DE number 6122691 |
Statements
Finding a Maximum Induced Degenerate Subgraph Faster Than 2 n (English)
0 references
7 January 2013
0 references
0.8148474097251892
0 references
0.8040059804916382
0 references
0.8014360070228577
0 references
0.7895014882087708
0 references
0.7852969765663147
0 references
